Skip to main content
Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity

Christos H. Papadimitriou, Kenneth Steiglitz

Combinatorial Optimization: Algorithms and Complexity

January 1, 1998Courier Corporation530 pages
Community grade. The average of the grades people here gave it. No critics, no outside scores.
No grades yet

or to grade, review, and add to your backlog.

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.

Community reviews

No reviews yet. Be the first to review this book.

More like this