 |
GetTextbooks.com
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou ISBN-10: 9780131524620 ISBN-10: 0-13-152462-3 ISBN-13: 9780131524620 ISBN-13: 978-0-13-152462-0 Hardcover 1981-09 Prentice Hall Find Lowest Price |
Editorials | ||
Product Description Clearly written graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly. 1982 edition. . | ||
Reviews | ||
helpful and easy to read I read the book and found it very helpful. It has a very excellent point of view and very easy to understand. | ||
Excellent book! This book is excellent. However, it's dense, so you'll have to read it carefully and never in a hurry. | ||
Well written I bought this book because I wanted to have theory on linear programming including duality, integer linear programming, typical graph algorithms and matroid theory in one book. Up to now I have read only most of the chapter on matroids and I would like to say a big thanks to the author. Although you will not solve the world's problems with greedy algorithms, my mathematical part of the heart was pleased and satisfied by the theory which explained the very nice relation between matroids and greedy algorithms. Maybe I will tell you more in a few months | ||
Combinatorial Optimization: Algorithms and Complexity The book's state is very good, so I am satisfied with it. | ||
A classic... I won't lie to you: this book is well written but relatively hard to read. The subject is inherently difficult, after all! I highly suggest it, though, because the author is a recognized expert on the field and the price is relatively low. It's worth it even if you enjoy a few pages... | ||