Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties | 
 enlarge | Authors: G. Ausiello, P. Crescenzi, V. Kann, Marchetti-sp, Giorgio Gambosi, Alberto M. Spaccamela
Publisher: Springer
Category: Book
List Price: $99.00
Buy New: $74.90
You Save: $24.10 (24%)
New (20) Used (7) from $62.03
Rating:  3 reviews
Sales Rank: 727084
Media: Hardcover
Edition: Corrected
Pages: 524
Number Of Items: 1
Shipping Weight (lbs): 2.6
Dimensions (in): 9.8 x 8.1 x 1.5
ISBN: 3540654313
Dewey Decimal Number: 519.3
EAN: 9783540654315
Publication Date: February 1, 2003
Availability: Usually ships in 1-2 business days
Condition: Absolutely Brand New & In Stock. 100% 30-Day Money Back. Direct from our warehouse. Ships by USPS. 1+ million customers served-In business since 1986. Happy Customers is Our #1 Goal. Toll Free Support
| |
| Similar Items:
|
| Editorial Reviews:
Product Description
This book is an up-to-date documentation of the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The well-structured wealth of problems, algorithms, results, and techniques introduced systematically will make the book an indispensible source of reference for professionals. The smooth integration of numerous illustrations, examples, and exercises make this monograph an ideal textbook.
|
| Customer Reviews:
A great sequel to Garey and Johnson March 29, 2001
KARTIK KRISHNAN S. (Hamilton, Ontario Canada)
15 out of 16 found this review helpful
This book is a great sequel to Garey and Johnson. The appendix of this book gives a list of all NP optimisation problems together with their current approximability (or inapproximability results) in a Garey Johnson fashion.Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. There have been a number of exciting developments like semidefinite programming , the Goemans Williamson algorithm for max cut et al. On the other hand, from a theoretical computer science point of view, we now have a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP. This book provides an excellent introduction to both areas. A worthy supplement to Garey and Johnson, Papadimitriou's books on combinatorial optimisation and computational complexity, Hochbaum's book on approximation algorithms, Alon and Spencer's book on the probabilistic method and finally Motwani and Raghavan's book on randomised algorithms.
A great sequel to Garey and Johnson March 30, 2001
KARTIK KRISHNAN S. (Hamilton, Ontario Canada)
1 out of 1 found this review helpful
This book is a great sequel to Garey and Johnson. The appendix of this book gives a list of all NP optimisation problems together with their current approximability (or inapproximability results) in a Garey Johnson fashion.Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. There have been a number of exciting developments like semidefinite programming , the Goemans Williamson algorithm for max cut et al. On the other hand, from a theoretical computer science point of view, we now have a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP. This book provides an excellent introduction to both areas. A worthy supplement to Garey and Johnson, Papadimitriou's books on combinatorial optimisation and computational complexity, Hochbaum's book on approximation algorithms, Alon and Spencer's book on the probabilistic method and finally Motwani and Raghavan's book on randomised algorithms.
Complexity book August 24, 2007
Wolfgang Bein (Las Vegas)
0 out of 2 found this review helpful
The book is excellent for teaching approximation algorithms. The book was new, but I benefit of a reduced price (probably promotional).
|
|
|
