|
|
|
Combinatorial Optimization
Algorithms and Complexity
 |
Browse |
 |
|
|
by Christos H. Papadimitriou and Kenneth Steiglitz
Dover Publications
Due/Published
July 1998, 486 pages,
paper
ISBN
0486402584
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. |
|
