Combinatorial Optimization
Algorithms and Complexity
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.
read more
pages
530
Year published
1998
Publisher
Courier Corporation
Issn
0-486-40258-4
Language
en