Combinatorial Optimization: Algorithms and Complexity [UNABRIDGED] (Paperback)

by Christos H. Papadimitriou (Author), Kenneth Steiglitz (Author)

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.

Product Details

• Paperback: 512 pages
• Publisher: Dover Publications; Unabridged edition (January 29, 1998)
• Language: English
• ISBN-10: 0486402584
• ISBN-13: 978-0486402581
• Product Dimensions: 8.4 x 5.3 x 1 inches
• Shipping Weight: 1.2 pounds (View shipping rates and policies)
• Average Customer Review: 4.6 out of 5 stars See all reviews (18 customer reviews)
• Amazon.com Sales Rank: #76,169 in Books (See Bestsellers in Books)

  Popular in these categories: (What's this?)

  #7 in	Books > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Combinatorics
  #8 in	Books > Science > Mathematics > Pure Mathematics > Combinatorics

Customer Reviews

Most Helpful Customer Reviews

35 of 37 people found the following review helpful:

5.0 out of 5 stars Inexpensive, excellently written, and quite interesting!, November 14, 2002

By	Todd Ebert (Long Beach California) - See all my reviews

I had this book on my shelf for two years before taking a serious look at it, and only wish I had read it much earlier in life. Christos Papadimitriou has written quite a gem! On one hand this book serves as a good introduction to combinatorial optimization algorithms, in that it provides a flawless introduction to the simplex algorithm, linear and integer programming, and search techniques such as Branch-and-Bound and dynamic programming. On another, it serves as a good reference for many graph-theoretic algorithms. But most importantly Papadimitriou and Steiglitz seem to be on a quest to understand why some problems, such as Minimum Path or Matching, have efficient solutions, while others, such as Traveling Salesman, do not. And in doing so they end up providing the reader with a big picture behind algorithms and complexity, and the connection between optimization problems and complexity.

After reading this and Papadimitriou's "Introduction to Computational Complexity" (which I also highly recommend), I now consider him one of the best at conveying complex ideas in a way that rarely confuses the reader. I also had the priviledge of attending one of his talks on complexity, and he seems just as effusive and transparent as a lecturer as he does a writer. Ah, for once I bought a Dover book that did not disappoint.

25 of 26 people found the following review helpful:

4.0 out of 5 stars A classic, May 7, 1999

By	SeanFurl (San Francisco) - See all my reviews

This is just a note to mention that athough Amazon has dated this book as published in 1998, it is actually around 15 years old. By the way, it's a good book, but I didn't find it an easy read, especially the first half. One needs to already have a foundation in linear programming and optimization to digest it. A previous reviewer who said that every programmer should read it was being unduly exuberant, presumably because it happened to hit his particular spot. Most programmers don't need combinatorial optimization and for those who do there are some good alternative books.

19 of 20 people found the following review helpful:

5.0 out of 5 stars A Masterpiece on Combinatorial Optimisation, November 30, 1999

By	KARTIK KRISHNAN S. (Hamilton, Ontario Canada) - See all my reviews

Christos Papadimitriou, my hero is a hope for all of us who wish to master the fascinating field of Combinatorial Optimisation. Especially recommended are the chapters on matching, NP Completeness and Approximation Algorithms.

As another reader has remarked, this book is quite old though (published first in 1982). For a more to date book on Combinatorial Optimisation, one might want to look at Cook, Cunningham, Pulleyblank and Schrijver's book on Combinatorial Optimisation (published in 1998).