Customer Reviews


4 Reviews
5 star:
 (2)
4 star:    (0)
3 star:
 (1)
2 star:
 (1)
1 star:    (0)
 
 
 
 
 
Average Customer Review
Share your thoughts with other customers
Create your own review
 
 

The most helpful favourable review
The most helpful critical review


9 of 11 people found the following review helpful
5.0 out of 5 stars Excellent.
Every programmer should have read this book. It is complete, detailed and makes a great reference for the engineer's bookshelf. It goes beyong the enumeration of cookie-cutter algorithms , by providing enough theory, to let you create solutions to your own optimization problems.
Published on 19 Jun 1998

versus
1 of 1 people found the following review helpful
3.0 out of 5 stars Reasonable
I bought this book for uni and it is generally quite good although very complex and in depth. I found it quite hard to read over all and there is a lot of complicated maths involved, buy as I said it was quite helpful for the course.
Published 15 months ago by Adam Gnourie


Most Helpful First | Newest First

1 of 1 people found the following review helpful
3.0 out of 5 stars Reasonable, 19 May 2013
By 
Adam Gnourie (UK Macclesfield) - See all my reviews
(REAL NAME)   
Verified Purchase(What is this?)
This review is from: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) (Paperback)
I bought this book for uni and it is generally quite good although very complex and in depth. I found it quite hard to read over all and there is a lot of complicated maths involved, buy as I said it was quite helpful for the course.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


1 of 1 people found the following review helpful
2.0 out of 5 stars Hard to read book, 24 Sep 2012
This review is from: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) (Paperback)
I'm only in the second chapter, but so far I have found this book very unpleasant to read. The book claims to be written for "mathematically sophisticated" students, but the definitions and proofs are often carelessly written regarding mathematical correctness. In every definition you have to guess what they mean with the undefined variables, and there is little further explanation if you didn't get it. It is not a very difficult subject, but the way it is presented here makes it impossible to grasp.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


9 of 11 people found the following review helpful
5.0 out of 5 stars Excellent., 19 Jun 1998
By A Customer
This review is from: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) (Paperback)
Every programmer should have read this book. It is complete, detailed and makes a great reference for the engineer's bookshelf. It goes beyong the enumeration of cookie-cutter algorithms , by providing enough theory, to let you create solutions to your own optimization problems.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


6 of 8 people found the following review helpful
5.0 out of 5 stars It worths exponentially much more than its price, 11 Mar 2003
By 
G. Avvinti (Sicily, Italy) - See all my reviews
(REAL NAME)   
This review is from: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) (Paperback)
One could buy this book for different reasons: interests in combinatorial optimization, of course; interests in what Papadimitriou has to say, since his thoughts on this subject are definitely invaluable; perhaps the price is a good reason alone.
Whatever the reason, however, I think that would be a rare event to remain duped.
I was preparing my exam in Computability and Complexity when I first used it. I've been wonderfully surprised by the amount of definitions, algorithms, concepts I've found in this book. I think one could use this book for a simple course on Algorithms, on Computability and/or Complexity, on the whole Combinatorial Optimization, and the book would be always and costantly useful.
The chapters on algorithms and complexity, or those on NP completeness have proved to be gems. The chapters on Approximation and Local Search are great, and they feature a bunch of detailed and excellent quality stuff (e.g. there is a detailed treatment of Christofides' algorithm to approximate the TSP, that is quite an idiosyncratic topic).
All in all, a very great book, with a value exponentially greater than the very insignificant price.
Help other customers find the most helpful reviews 
Was this review helpful to you? Yes No


Most Helpful First | Newest First

This product

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
17.57
In stock
Add to basket Add to wishlist
Only search this product's reviews