| Combinatorial Optimization: Algorithms and Complexity Revised Edition Contributor(s): Papadimitriou, Christos H. (Author), Steiglitz, Kenneth (Author) |
|
 |
ISBN: 0486402584 ISBN-13: 9780486402581 Publisher: Dover Publications OUR PRICE: $27.00 Product Type: Paperback - Other Formats Published: January 1998 Annotation: 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.. |
| Additional Information |
| BISAC Categories: - Mathematics | Combinatorics |
| Dewey: 519 |
| LCCN: 98021476 |
| Series: Dover Books on Computer Science |
| Physical Information: 1.04" H x 5.48" W x 8.47" (1.17 lbs) 528 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |