HOME | BESTSELLERS | NEW RELEASES | PRICE WATCH | FICTION | BIOGRAPHIES | E-BOOKS |
+ PRICE WATCH
* Amazon pricing is not included in price watch
Approximation Algorithms for n-p Hard Problems Book
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.Read More
from£N/A | RRP: * Excludes Voucher Code Discount Also available Used from £N/A
- 0534949681
- 9780534949686
- Dorit Hochbaum
- 25 August 1996
- Course Technology Inc
- Hardcover (Book)
- 624
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.
Would you like your name to appear with the review?
We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.
All form fields are required.