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.
| ISBN: | 9780486402581 |
| Publication date: | 1st February 2000 |
| Author: | Christos H Papadimitriou, Kenneth Steiglitz |
| Publisher: | Search Press an imprint of Dover Publications Inc |
| Format: | Paperback |
| Pagination: | 496 pages |
| Series: | Dover Books on Computer Science |
| Genres: |
Combinatorics and graph theory |