Tell your friends about this item:
Combinatorial Optimization: Algorithms and Complexity Christos H. Papadimitriou New edition
Combinatorial Optimization: Algorithms and Complexity
Christos H. Papadimitriou
This 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; local search heuristics for NP-complete problems, more. 1982 edition.
528 pages
| Media | Books Paperback Book (Book with soft cover and glued back) |
| Released | February 1, 2000 |
| ISBN13 | 9780486402581 |
| Publishers | Dover Publications Inc. |
| Pages | 528 |
| Dimensions | 136 × 214 × 26 mm · 644 g |
More by Christos H. Papadimitriou
Others have also bought
See all of Christos H. Papadimitriou ( e.g. Paperback Book )
Christmas presents can be returned until 31 January