eShop USA > Books > Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
List Price: $99.00Our Price: $79.11 You Save: $19.89 (20%)Prices subject to change.
Availability: Usually ships in 24 hours
Binding: Hardcover
Dewey Decimal Number: 519.3
EAN: 9783540654315
Edition: Corrected
ISBN: 3540654313
Label: Springer
Manufacturer: Springer
Number Of Items: 1
Number Of Pages: 524
Publication Date: February 01, 2003
Publisher: Springer
Studio: Springer
Related Items: Featured Listmania!
Editorial Review:
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
Average Rating: 
Rating: - Complexity book
The book is excellent for teaching approximation algorithms. The book was new, but I benefit of a reduced price (probably promotional).
Rating: - A great sequel to Garey and Johnson
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 ... Read More
Rating: - A great sequel to Garey and Johnson
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 ... Read More
Related Categories:
| |
 |
