Brightsurf Science News and Current Science News Events
 

View Larger Image

Combinatorial Optimization: Algorithms and Complexity


by Christos H. Papadimitriou, Kenneth Steiglitz

List Price: $19.95
Price: $13.57
You Save: $6.38 (32%)
Available: Usually ships in 24 hours
Sales Rank: 50084
Studio: Dover Publications
Binding: Paperback
Number Of Pages: 512
Publication Date: January 29, 1998
Publisher: Dover Publications


FORMATS

  • Unabridged


EDITORIAL REVIEWS

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.
.


CUSTOMER REVIEWS (Average Customer Rating: 4.5 based on 18 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.
May 04, 2008

Excellent book!  
This book is excellent. However, it's dense, so you'll have to read it carefully and never in a hurry.

June 05, 2007

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
April 06, 2007

Combinatorial Optimization: Algorithms and Complexity  
The book's state is very good, so I am satisfied with it.
February 18, 2007

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...
January 11, 2007


SIMILAR PRODUCTS

Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)
by M. R. Garey, D. S. Johnson

Approximation Algorithms
by Vijay V. Vazirani

Combinatorial Optimization: Networks and Matroids
by Eugene Lawler

Introductory Graph Theory
by Gary Chartrand

Introduction to Algorithms
by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

© 2008 BrightSurf.com