Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou, Kenneth Steiglitz
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. 1982 ed.
Година:
1998
Издание:
Unabridged
Издателство:
Dover Publications
Език:
english
Страници:
513
ISBN 10:
0486402584
ISBN 13:
9780486402581
Файл:
DJVU, 3.97 MB
IPFS:
,
english, 1998