HomeGroupsTalkMoreZeitgeist
Search Site
This site uses cookies to deliver our services, improve performance, for analytics, and (if not signed in) for advertising. By using LibraryThing you acknowledge that you have read and understand our Terms of Service and Privacy Policy. Your use of the site and services is subject to these policies and terms.

Results from Google Books

Click on a thumbnail to go to Google Books.

Combinatorial Optimization: Algorithms and…
Loading...

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) (edition 1998)

by Christos H. Papadimitriou (Author)

MembersReviewsPopularityAverage ratingConversations
233None117,833 (3.94)None
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.… (more)
Member:DuncanKountz
Title:Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Authors:Christos H. Papadimitriou (Author)
Info:Dover Publications (1998), Edition: Unabridged, 528 pages
Collections:Your library
Rating:
Tags:None

Work Information

Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou

None
Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review

» Add other authors

Author nameRoleType of authorWork?Status
Christos H. Papadimitriouprimary authorall editionscalculated
Steiglitz, Kennethmain authorall editionsconfirmed
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Original language
Canonical DDC/MDS
Canonical LCC

References to this work on external resources.

Wikipedia in English (2)

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.

No library descriptions found.

Book description
Haiku summary

Current Discussions

None

Popular covers

Quick Links

Rating

Average: (3.94)
0.5
1
1.5
2
2.5
3 2
3.5 1
4 3
4.5
5 2

Is this you?

Become a LibraryThing Author.

 

About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 208,766,336 books! | Top bar: Always visible