Algorithmics For Hard Problems
Download and Read Algorithmics For Hard Problems full books in PDF, ePUB, and Kindle. Read online free Algorithmics For Hard Problems ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
Approximation Algorithms for NP-hard Problems
Author | : Dorit S. Hochbaum |
Publisher | : Course Technology |
Total Pages | : 632 |
Release | : 1997 |
Genre | : Computers |
ISBN | : |
Download Approximation Algorithms for NP-hard Problems Book in PDF, Epub and Kindle
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.
Approximation Algorithms for NP-hard Problems Related Books
Pages: 632
Pages: 380
Pages: 1313
Pages: 501
Pages: 0