Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou, Kenneth Steiglitz - Combinatorial Optimization: Algorithms and Complexity
Published: 1998-01-29 | ISBN: 0486402584, 0131524623 | PDF | 528 pages | 49 MB
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.