Full name: Combinatorial Optimization: Algorithms and Complexity

Authors: Christos H. Papadimitriou, Kenneth Steiglitz Rank: Rating: Original Rating: Pop Rating: Genres/categories: Purchase/reserch links: LibraryThing Goodreads Amazon ISBNs: 9780486402581 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. "Mathematicians wishing a self-contained introduction need look no further." -- American Mathematical Monthly. Similar books: Algorithms by Robert Sedgewick The Design and Analysis of Computer Algorithms by Alfred V. Aho Computers and Intractability by M. R. Garey