Combinatorial Optimization: Algorithms and Complexity |  | Authors: Christos H. Papadimitriou, Kenneth Steiglitz
Publisher: Dover Publications
List Price: $19.95
Buy New: $10.39
as of 11/22/2009 02:05 CST details
You Save: $9.56 (48%)
New (29) Used (15) from $8.95
Seller: a1books
Rating:  18 reviews
Sales Rank: 122483
Format: Unabridged
Media: Paperback
Edition: Unabridged
Pages: 512
Number Of Items: 1
Shipping Weight (lbs): 1.2
Dimensions (in): 8.4 x 5.3 x 1
ISBN: 0486402584
Dewey Decimal Number: 519.3
EAN: 9780486402581
ASIN: 0486402584
Publication Date: January 29, 1998
Availability: Usually ships in 1-2 business days
| |
| Features:
|
| Also Available In:
|
| Similar Items:
| |
| Editorial Reviews:
Product Description
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses 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. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."—American Mathematical Monthly. 1982 ed.
|
| Customer Reviews:
Showing reviews 1-5 of 18
 helpful and easy to read May 4, 2008
Bo Li (gainesville,fl,usa)
0 out of 1 found this review helpful
I read the book and found it very helpful. It has a very excellent point of view and very easy to understand.
Excellent book! June 5, 2007
W. Ghost (Brazil)
0 out of 1 found this review helpful
This book is excellent. However, it's dense, so you'll have to read it carefully and never in a hurry.
 Well written April 5, 2007
Robert Macho (Slovakia)
1 out of 1 found this review helpful
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 February 18, 2007
Jaehoon Jeong
0 out of 5 found this review helpful
The book's state is very good, so I am satisfied with it.
A classic... January 11, 2007
Petros K. Tsantoulis
1 out of 1 found this review helpful
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...
Showing reviews 1-5 of 18
|
|
|
|
