Digital List Price:	CDN$ 29.47
Print List Price:	CDN$ 40.50
Kindle Price:	CDN$ 16.21 Save CDN$ 24.29 (60%)
	includes free international wireless delivery via *Amazon Whispernet*
Sold by:	Amazon.com.ca, Inc.

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) by [Christos H. Papadimitriou, Kenneth Steiglitz]

Follow the Authors

Christos H. Papadimitriou

Ken Steiglitz

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Unabridged Edition, Kindle Edition

by Christos H. Papadimitriou (Author), Kenneth Steiglitz (Author) Format: Kindle Edition

4.4 82 ratings

Part of: Dover Books on Computer Science (19 books)

See all formats and editions

Amazon Price

New from

Used from

Kindle Edition

"Please retry"

$16.21

—

Hardcover

"Please retry"

$47.80

—

$20.01

Paperback

"Please retry"

$39.51

$24.42

$11.64

Kindle Edition
$16.21 Read with Our Free App
Hardcover
$47.80

10 Used from $20.01 1 Collectible from $118.52
Paperback
$39.51

12 Used from $11.64 13 New from $24.42 1 Collectible from $97.11

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.

ISBN-13

978-0486402581
Edition

Unabridged
Sticky notes

On Kindle Scribe
Publisher

Dover Publications
Publication date

April 26 2013
Part of series

Dover Books on Computer Science
Language

English
File size

22437 KB
See all details

Due to its large file size, this book may take longer to download

See all supported devices

Next 2 for you in this series See full series

Total Price: CDN$51.45

Sold by: Amazon.com.ca, Inc.

Product description

About the Author

Christos H. Papadimitriou is C. Lester Hogan Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley, where he has taught since 1996 and where he is a former Miller Fellow. --This text refers to an alternate kindle_edition edition.

Product details

ASIN ‏ : ‎ B00C8UQZAO
Publisher ‏ : ‎ Dover Publications; Unabridged edition (April 26 2013)
Language ‏ : ‎ English
File size ‏ : ‎ 22437 KB
Text-to-Speech ‏ : ‎ Enabled
Screen Reader ‏ : ‎ Supported
Enhanced typesetting ‏ : ‎ Enabled
X-Ray ‏ : ‎ Not Enabled
Word Wise ‏ : ‎ Not Enabled
Sticky notes ‏ : ‎ On Kindle Scribe
Print length ‏ : ‎ 530 pages

Best Sellers Rank: #678,749 in Kindle Store (See Top 100 in Kindle Store)
- #19 in Combinatorics (Kindle Store)
- #19 in Combinatorics eBooks
- #140 in Combinatorics (Books)

Customer Reviews:
4.4 82 ratings

About the authors

Follow authors to get new release updates, plus improved recommendations.

Ken Steiglitz
Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.
Ken Steiglitz is professor emeritus of computer science and senior
scholar at Princeton University. He taught there for 48 years, with
research in digital signal processing, algorithms, complexity,
auction theory, economic modeling, and the foundations of computing.
See more on the author's page
Christos H. Papadimitriou
Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.
Christos Papadimitriou was born and raised in Athens, Greece, and studied in Athens and at Princeton. He has taught Computer Science at Harvard, MIT, Stanford, and, since 1996, at Berkeley, where he is the C. Lester Hogan Professor of Computer Science. In his research he uses mathematics to understand the power and limitations of computers. He is a member of the National Academy of Sciences, the American Academy of Arts and Sciences, and the National Academy of Engineering. He has written several of the standard textbooks in algorithms and computation, and three novels: "Turing," "Logicomix" (with Apostolos Doxiadis, art by Alecos Papadatos and Annie di Donna), and "Independence" (2017).
See more on the author's page

Richard Bellman
35
Kindle Edition
1 offer from $26.13
V. K . Balakrishnan
147
Kindle Edition
1 offer from $16.17
Richard J. Trudeau
483
Kindle Edition
1 offer from $12.04
John R. Pierce
310
Kindle Edition
1 offer from $18.66
Bert Mendelson
411
Kindle Edition
1 offer from $9.61
George E. Andrews
291
Kindle Edition
1 offer from $18.66

Customer reviews

4.4 out of 5

82 global ratings

5 star		72%
4 star		11%
3 star		7%
2 star		5%
1 star		5%

How are ratings calculated?

Top reviews from Canada

There was a problem filtering reviews right now. Please try again later.

AmazonLifer

Classic, but a little out of date

Reviewed in Canada 🇨🇦 on January 14, 2021

Verified Purchase

Wonderful text on combinatorial optimization. The treatment of linear optimization alone is worth the price of admission. I like the unifying point of view of various combinatorial algorithms in a primal-dual framework. Unifying frameworks are always insightful to add to your arsenal of insights.

Reviewed in Canada 🇨🇦 on October 6, 2019

Verified Purchase

Thorough coverage of theory and algorithms for various combinatorial optimization problems. The algorithms are hard to follow because there are multiple dependencies throughout the book.

Helpful

Jose Martinez

It is a most welcomed Dover corrected edition of a ...

Reviewed in Canada 🇨🇦 on October 23, 2016

Verified Purchase

It is a most welcomed Dover corrected edition of a classic book on the subject of Combinatorial Optimization, 15 years after the publication of the first edition in 1982.

Combined with an affordable and timely service by Amazon!

Helpful

Todd Ebert

Inexpensive, excellently written, and quite interesting!

Reviewed in Canada 🇨🇦 on November 14, 2002

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.

3 people found this helpful

Helpful

G. Avvinti

It worths exponentially much more than its price

Reviewed in Canada 🇨🇦 on June 21, 2002

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.

One person found this helpful

Helpful

SeanFurl

A classic

Reviewed in Canada 🇨🇦 on May 7, 1999

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.

6 people found this helpful

Helpful

JAMIE R LAWSON

A great book and a great deal

Reviewed in Canada 🇨🇦 on November 17, 2001

As a computer science graduate student I carried Papadimitriou and Steiglitz with me almost every day. Its target subject is combinatorial optimization, but going through this book, you might think that graph theory and computational complexity are just subfields of combinatorial optimization. It builds a beautiful theory that brings these and other fields together, and with a fraction of the page count of, say, Cormen, Rivest Leiserson. Now that it's a Dover book, it's a fraction of the price I paid, and I was gladly willing to pay that.

Helpful

max2001

It is the Globally Optimal Solution!

Reviewed in Canada 🇨🇦 on July 11, 2003

I can't say more than what already been said by other reviewers. To recap,
F = {all excellent combinatorial optimization books}
cost(this_book) <= cost(y) for all y in F.
;)

Helpful

Top reviews from other countries

Translate all reviews to English

Adam Ginourie

Reasonable

Reviewed in the United Kingdom 🇬🇧 on May 19, 2013

Verified Purchase

I bought this book for uni and it is generally quite good although very complex and in depth. I found it quite hard to read over all and there is a lot of complicated maths involved, buy as I said it was quite helpful for the course.

5 people found this helpful

Corrado

Great content, very poor and cheap edition

Reviewed in Italy 🇮🇹 on July 5, 2022

Verified Purchase

Content-wise, the book is timeless and I find it pleasant to read despite being a non-expert in the field. However, the edition is so low-quality that it would be unworthy of even the poorest of college publishers. Some pages are not even properly separated at the top and the paper has been cut in a rough way (see picture). Maybe it is an issue with my copy only, but such a book would deserve more respect.

One person found this helpful

CorMag

Great!!

Reviewed in Germany 🇩🇪 on December 18, 2009

Verified Purchase

Eine Warnung vorweg: dies ist mein bisher erstes Buch zum Thema. Daher kann ich es nicht mit anderen Büchern zur selben Thematik vergleichen. Quasi sind die fünf Sterne "absolut" und nicht "relativ" zu verstehen.

Das Buch ist in leicht verständlichem Englisch geschrieben. Die Kapitel zu NP Complete, Branch & Bound fand ich besonders schön. Zu jeder Definition sind auch für den Nicht-Mathematiker verständliche Beispiele angegeben. Obwohl mir das Buch für meine spezielle Problemstellung nicht direkt geholfen hat und Local Search Verfahren und Heurismen etwas zu kurz kommen, war es doch gut um die Grundlagen zu legen und ist auch als Nachschlagewerk geeignet. Didaktisch sehr schön aufgebaut. Beweise werden an Stellen geführt, wo sie der Intuition dienen, nicht nur des Beweises wegen. Ich hätte mir noch Lösungen für die Übungsaufgaben gewünscht. Wahrscheinlich nicht auf dem neusten Stand (kann ich nicht beurteilen) und wie gesagt sind für viele "real world" Probleme keine echten Lösungsansätze angeboten, aber dafür gibts ja auch noch wissenschaftliche paper. Als Einführung und Grundlagenwerkfand find ich es klasse.

Fazit: Ein Buch über Combinatorial Optimization, mit schönem Schriftbild, schönen Abbildungen und einer MENGE Inhalt....für nich mal 14EUR! Das sollte sich der Springer-Verlag mal hinter die Ohren schreiben:)

Jutes Ding

5 people found this helpful

Translate review to English

Giorgio Benzi

Un sempreverde

Reviewed in Italy 🇮🇹 on December 13, 2010

Verified Purchase

Lo avevo usato venticinque anni fa per preparare un esame. Il libro è datato, la stesura originale è del 1982, tuttavia contiene nozioni fondamentali, ben sviluppate, sull'ottimizzazione combinatoria, trattate con sufficiente rigore formale.
Lo consiglierei come testo di base, per gli approfondimenti pratici esistono testi specifici deciamente più settoriali.
Il prezzo è davvero stracciato, varrebbe la pena anche se fosse utile un solo capitolo.

3 people found this helpful

Translate review to English

benedetta

ottimo testo!

Reviewed in Italy 🇮🇹 on April 9, 2014

Verified Purchase

Ho acquistato questo libro per un esame universitario di Ottimizzazione combinatoria.
Devo dire che è un testo completo, certamente essenziale per un matematico.
Amazon come sempre offre il prezzo migliore e spedizione affidabile.
Consigliato!

Amazon Music Stream millions of songs	Amazon Advertising Find, attract and engage customers	Amazon Business Everything for your business	Amazon Drive Cloud storage from Amazon	Amazon Web Services Scalable Cloud Computing Services

Book Depository Books With Free Delivery Worldwide	Goodreads Book reviews & recommendations	IMDb Movies, TV & Celebrities	Amazon Photos Unlimited Photo Storage Free With Prime	Shopbop Designer Fashion Brands

Warehouse Deals Open-Box Discounts	Whole Foods Market We Believe in Real Food	Amazon Renewed Like-new products you can trust	Blink Smart Security for Every Home

Follow the Authors

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Unabridged Edition, Kindle Edition

Product description

About the Author

Product details

About the authors

Ken Steiglitz

Christos H. Papadimitriou

Customers who bought this item also bought

Customer reviews

Top reviews from Canada

There was a problem filtering reviews right now. Please try again later.

Top reviews from other countries