Approximation Algorithms for NP-Hard Problems (Repost)
Dorit Hochbaum, "Approximation Algorithms for NP-Hard Problems"
Co..u.rse Tec..hnol.og.y | English | 1996-07-26 | ISBN: 0534949681 | 624 pages | DJVU | 14.5 mb
Co..u.rse Tec..hnol.og.y | English | 1996-07-26 | ISBN: 0534949681 | 624 pages | DJVU | 14.5 mb
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.
Welcome to my AH collection of ebooks at: http://avaxhome.ws/blogs/elodar
You can also connect to my RSS
You can also connect to my RSS