- Почетна страница /
- Knjige /
- Računari i tehnologija /
- Programming /
- Algorithms /
- The Design of Approximation Algorithms
The Design of Approximation Algorithms
90% of respondents would recommend this to a friend
RSD 9461
Price Details
Excluding Shipping & Custom charges ( Shipping and custom charges will be calculated on checkout )
*All items will import from SAD
QTY:
Ubuy works hard to protect your security and privacy. Our advanced payment security system ensures confidentiality by encrypting your information during transmission using AES (Advanced Encryption Standards) and SSL (Secure Socket Layer) protocols. Your payment details are 100% secure as we do not share your payment details with third party sellers.
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions.
Fast
Shipping
Free
Return*
Secure Packaging
100% Original Products
PCI DSS Compliance
ISO 27001 Certified
What Stands Out
Детаљи о производу
| Publisher | Cambridge University Press |
| Publication date | April 26, 2011 |
| Edition | 1st |
| Language | English |
| Print length | 518 pages |
| ISBN-10 | 0521195276 |
| ISBN-13 | 978-0521195270 |
| Item Weight | 2.47 pounds (1.12 kg) |
| Dimensions | 7.5 x 1.25 x 10.5 inches (19.1 x 3.2 x 26.7 cm) |
Who Should Buy?
-
Computer Science Students
Ideal for students pursuing algorithms or computer science degrees, enhancing their understanding of approximation algorithms.
-
Research Scholars
Beneficial for scholars conducting research in algorithm design, aiding in practical applications of theoretical concepts.
-
Software Engineers
Useful for software engineers tackling complex problems, providing techniques to develop efficient algorithms.
-
Casual Readers
Not suitable for casual readers due to its technical content and requirement of prior knowledge in algorithms.
OPIS PROIZVODA
The Design of Approximation Algorithms
Питања и одговори купаца
-
Pitanje:
Како купити The Design of Approximation Algorithms на мрежи од Убуи-а?
Odgovor: Лако је куповати The Design of Approximation Algorithms на мрежи од Убуи-а.. Морате само да потражите производ, изаберете начин испоруке приликом одјављивања и да га испоручите на вашу локацију. -
Pitanje:
Да ли је The Design of Approximation Algorithms доступан за онлајн куповину у Serbia?
Odgovor: Да, у Убуи Serbia овај производ је доступан за куповину по разумној цени.. The Design of Approximation Algorithms није доступан локално, али можете нам веровати у наше услуге експресне испоруке. -
Pitanje:
Колико времена је потребно да се производ добије након наручивања?
Odgovor: Време испоруке вашег нарученог производа варира у зависности од тога шта сте наручили и начина испоруке који сте изабрали.. Процењено време испоруке се помиње током процеса плаћања, па будите безбрижни док купујете.
Algorithms Editorial Review
The "Design of Approximation Algorithms" (1st Edition) is a comprehensive textbook that serves as an excellent resource for understanding modern concepts in discrete optimization. Reviewers have found the material to be accessible, with clear proofs and a structured approach that lends itself well to academic settings. This book has proven useful for courses, suggesting that it effectively engages students with its thorough coverage. The organization of content is notably praised, with each chapter targeting different classes of problems and presenting corresponding approximation algorithms, supplemented by practical examples that solidify understanding. The book is seen as a valuable reference for uncovering the nuances of primal and dual solutions within optimization problems. However, some readers have pointed out that the mathematical approach can feel daunting. While early chapters are more engaging, later sections may become overwhelming due to their "cold" mathematical formulation. This has led to mixed feelings among those looking for a more narrative-driven explanation rather than strict mathematical rigor. Overall, while the book is a formidable resource filled with detail and depth, some users may desire more illustrative examples to complement its rigorous mathematical content, particularly if they come from a more applied background rather than a pure mathematical one. **
Customer Reviews & Ratings
-
5 zvezda
100%
-
4 zvezda
0%
-
3 zvezda
0%
-
2 zvezda
0%
-
1 zvezda
0%
Ocenite ovaj proizvod
Podelite svoja razmišljanja sa drugim kupcima
Прос
- Easy to follow material with clear proofs.
- Well organized, covering extensive topics in discrete optimization.
- Useful as a course textbook and reference.
- Engaging early chapters with practical examples.
Цонс
- Later chapters may be daunting due to their mathematical focus.
Product Price History
Važna informacija
- Ograničenja: Za proizvode koji se isporučuju međunarodno, imajte na umu da garancija proizvođača možda neće biti važeća; opcije servisiranja proizvođača možda neće biti dostupne; priručnici za proizvode, uputstva i upozorenja o bezbednosti možda nisu na jezicima zemlje odredišta; proizvodi (i prateći materijali) ne moraju biti dizajnirani u skladu sa standardima zemlje odredišta, specifikacijama i zahtevima za označavanje; a proizvodi možda nisu u skladu sa naponom zemlje odredišta i drugim električnim standardima (zahteva se upotreba adaptera ili pretvarača ako je potrebno). Primalac je odgovoran za osiguranje da se proizvod može zakonito uvesti u odredišnu zemlju. Prilikom naručivanja od kompanije Ubuy ili njegovih podružnica, primalac je nadležni uvoznik i mora se pridržavati svih zakona i propisa zemlje odredišta.
- Nisu svi proizvodi navedeni na Ubuy-u na prodaju, jer je Ubuy globalni pretraživač. Proizvodi podležu izvoznim/trgovačkim propisima.
RSD 9461
Naručite sada i dobijte oko Sreda, Oktobar 14
This item is not restrict in my country.(Please click on above link if this item is not restrict in your country, So our team will review and allow.)
QTY:
PCI DSS compliant and ISO 27001:2022 certified, with encrypted payments and full buyer protection on every order.
Карактеристике и предности
- Learn to design efficient approximation algorithms.
- Find provably near-optimal solutions for NP-hard problems.
- Covers essential algorithmic techniques like greedy, dynamic programming, and randomization.
- Structured for both graduate-level courses and researchers.
- Includes practical applications across various domains including operations research and computer science.
- Offers advanced methods for proving the complexity of optimization problems.
Ubuy Assurance
Experience worry-free shopping with 100% original products, PCI DSS-compliant payment security, ISO 27001-certified data protection, the fastest cross-border delivery, free returns *, and secure packaging on every order.