
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou, Kenneth SteiglitzCombinatorial Optimization: Algorithms and Complexity
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

Adding It Up: Helping Children Learn Mathematics
Mathematics Learning Study Committee

Principles And Standards For School Mathematics
National Research Council

La repubblica dei numeri
Piergiorgio Odifreddi

Murderous Maths
Kjartan Poskitt

Locally Conformal Kahler Geometry
Sorin Dragomir

Computations in Algebraic Geometry with Macaulay 2
David Eisenbud

A Topological Aperitif
Stephen A. Huggett

Momentum Maps and Hamiltonian Reduction
Juan-Pablo Ortega

