Combinatorial Optimization
Algorithms and Complexity
$53.46
- Paperback
528 pages
- Release Date
1 February 2000
Summary
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.”
Book Details
| ISBN-13: | 9780486402581 |
|---|---|
| ISBN-10: | 0486402584 |
| Author: | Christos H. Papadimitriou, Kenneth Steiglitz |
| Publisher: | Dover Publications Inc. |
| Imprint: | Dover Publications Inc. |
| Format: | Paperback |
| Number of Pages: | 528 |
| Edition: | New edition |
| Release Date: | 1 February 2000 |
| Weight: | 625g |
| Dimensions: | 27mm x 140mm x 216mm |
| Series: | Dover Books on Computer Science |
Christos H. Papadimitriou
Christos H. Papadimitriou is C. Lester Hogan Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley, where he has taught since 1996 and where he is a former Miller Fellow.
Returns
This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.