or
Sign in to turn on 1-Click ordering.
or
Amazon Prime free trial required. Sign up when you check out. Learn more
More Buying Choices
Have one to sell? Sell yours here
or
Get a £2.00 Amazon.co.uk Gift Card
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
 
 
Tell the Publisher!
I’d like to read this book on Kindle

Don't have a Kindle? Get your Kindle here, or download a FREE Kindle Reading App.

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) [Paperback]

Christos H. Papadimitriou , Kenneth Steiglitz
5.0 out of 5 stars  See all reviews (2 customer reviews)
RRP: £20.99
Price: £15.95 & this item Delivered FREE in the UK with Super Saver Delivery. See details and conditions
You Save: £5.04 (24%)
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
In stock.
Dispatched from and sold by Amazon.co.uk. Gift-wrap available.
Only 3 left in stock--order soon (more on the way).
Want guaranteed delivery by Thursday, June 7? Choose Express delivery at checkout. See Details

Formats

Amazon Price New from Used from
Hardcover --  
Paperback £15.95  
Trade In this Item for up to £2.00
Get an extra £5 when you trade in books worth £10 or more until June 30, 2012. Trade in Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) for an Amazon.co.uk gift card of up to £2.00, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.

Frequently Bought Together

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) + Introduction to Graph Theory (Dover Books on Advanced Mathematics) + Introduction to Topology (Dover Books on Mathematics)
Price For All Three: £34.41

Show availability and delivery details

Buy the selected items together


Product details

  • Paperback: 512 pages
  • Publisher: Dover Publications Inc.; New edition edition (1 Feb 2000)
  • Language English
  • ISBN-10: 0486402584
  • ISBN-13: 978-0486402581
  • Product Dimensions: 21.5 x 13.9 x 2.6 cm
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Bestsellers Rank: 232,481 in Books (See Top 100 in Books)

More About the Author

Christos H. Papadimitriou
Discover books, learn about writers, and more.

Visit Amazon's Christos H. Papadimitriou Page

Product Description

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.

Inside This Book (Learn More)
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Suggested Tags from Similar Products

 (What's this?)
Be the first one to add a relevant tag (keyword that's strongly related to this product)
 

Your tags: Add your first tag
 

Sell a Digital Version of This Book in the Kindle Store

If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store. Learn more


Customer Reviews

4 star
0
3 star
0
2 star
0
1 star
0
Most Helpful Customer Reviews
8 of 10 people found the following review helpful
Excellent. 19 Jun 1998
By A Customer
Format: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.
Comment | 
Was this review helpful to you?
6 of 8 people found the following review helpful
Format: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.

Was this review helpful to you?
Most Helpful Customer Reviews on Amazon.com (beta)
Amazon.com:  19 reviews
48 of 50 people found the following review helpful
Inexpensive, excellently written, and quite interesting! 14 Nov 2002
By Todd Ebert - Published on Amazon.com
Format:Paperback|Amazon Verified Purchase
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.

31 of 32 people found the following review helpful
A classic 7 May 1999
By SeanFurl - Published on Amazon.com
Format:Paperback
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.
21 of 22 people found the following review helpful
A Masterpiece on Combinatorial Optimisation 30 Nov 1999
By KARTIK KRISHNAN S. - Published on Amazon.com
Format:Paperback
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).

Search Customer Reviews
Only search this product's reviews

Customer Discussions

This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

Search Customer Discussions
Search all Amazon discussions
   


Listmania!


Look for similar items by category


Look for similar items by subject


Feedback


Amazon.co.uk Privacy Statement Amazon.co.uk Delivery Information Amazon.co.uk Returns & Exchanges