Order from a Major Online Bookstore
Ultimate Book Price Comparison Engine
Save Your Time And Money
| AnyBook4Less.com | Order from a Major Online Bookstore |
|
| Home | Store List | FAQ | Contact Us | | ||
| Ultimate Book Price Comparison Engine Save Your Time And Money |
||
 |
Title: Approximation Algorithms for NP-Hard Problems by Dorit Hochbaum ISBN: 0-534-94968-1 Publisher: Brooks Cole Pub. Date: 26 July, 1996 Format: Hardcover Volumes: 1 List Price(USD): $67.95 |
Average Customer Rating: 5 (1 review)
Rating: 5
Summary: A good survey on approximation algorithms
Comment: Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. This book is actually a collection of survey articles written by some of the foremost experts in this field.
Many of these developments are due to Mathemtical programming (primal dual, semidefinite programming et al). The most exciting of these has been the Goemans and Williamson algorithm for MAX CUT and MAX SAT. A good account of these techniques appears in Chapters 4 and 11.
On the other hand a sequence of unexpected results in complexity culminated in a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP. A good survey of "Hardness of Approximations" appears in Chapter 10, written by Sanjeev Arora and Carsten Lund both of whom were responsible for some original developments in this field.
I am going to purchase a copy of this book and can only strongly recommend it to everyone.
 |
Title: Approximation Algorithms by Vijay V. Vazirani ISBN: 3540653678 Publisher: Springer Verlag Pub. Date: 09 August, 2001 List Price(USD): $39.95 |
 |
Title: Randomized Algorithms by Rajeev Motwani, Prabhakar Raghavan ISBN: 0521474655 Publisher: Cambridge University Press Pub. Date: 25 August, 1995 List Price(USD): $60.00 |
 |
Title: Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties by G. Ausiello, P. Crescenzi, V. Kann, Marchetti-sp, Giorgio Gambosi, Alberto M. Spaccamela ISBN: 3540654313 Publisher: Springer Verlag Pub. Date: January, 2000 List Price(USD): $71.95 |
 |
Title: Computers and Intractability: A Guide to the Theory of Np-Completeness (Series of Books in the Mathematical Sciences) by Michael R. Garey, David S. Johnson ISBN: 0716710455 Publisher: W H Freeman & Co. Pub. Date: June, 1979 List Price(USD): $41.26 |
 |
Title: Combinatorial Optimization : Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz ISBN: 0486402584 Publisher: Dover Pubns Pub. Date: 07 July, 1998 List Price(USD): $18.95 |
Thank you for visiting www.AnyBook4Less.com and enjoy your savings!
Copyright� 2001-2021 Send your comments
