This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leading researchers in the field, this book introduces unifying techniques in the analysis of approximation algorithms. APPROXIMATION ALGORITHMS FOR NP-HARD PROBLEMS is intended for computer scientists and operations researchers interested in specific algorithm implementations, as well as design tools for algorithms. Among the techniques discussed: the use of linear programming, primal-dual techniques in worst-case analysis, semidefinite programming, computational geometry techniques, randomized algorithms, average-case analysis, probabilistically checkable proofs and inapproximability, and the Markov Chain Monte Carlo method. The text includes a variety of pedagogical features: definitions, exercises, open problems, glossary of problems, index, and notes on how best to use the book.
Combinatorial Algorithms: Generation, Enumeration, and Search eBook
$12.00
Coding Theory – Algorithms, Architectures, and Applications eBook
$13.00
Coding theory: a first course eBook
$13.00
- Delivery: Can be download immediately after purchasing. For new customer, we need process for verification from 30 mins to 24 hours.
- Version: PDF/EPUB. If you need another version, please Contact us
- Quality: Full page, full content, high quality images, searchable text and you can print it.
- Compatible Devices: Can be read on any devices (Kindle, NOOK, Android/IOS devices, Windows, MAC,..).
- e-Book Features: Purchase and read your book immediately, access your eTextbook anytime and anywhere, unlimited download and share with friends.
- Note: If you do not receive the download link within 15 minutes of your purchase, please Contact us. Thank you!
Coding theory: a first course eBook
$13.00
Reviews
There are no reviews yet.