Combinatorial Optimization by Christos H Papadimitriou

Combinatorial Optimization by Christos H Papadimitriou

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.

Ken Steiglitz is a Eugene Higgins Professor of Computer Science Emeritus and Senior Scholar at Princeton University. He received his Doctor of Engineering Science degree from New York University in 1963. In 1997 he was inducted as a Fellow of the Association for Computer Music, and in 2000 he received the IEEE Third Millennium Medal. He is the author of several books, including The Charm of the Discrete Machine: Why the World Became Digital.

SKU	Unavailable
ISBN 13	9780486402581
ISBN 10	0486402584
Title	Combinatorial Optimization
Author	Christos H Papadimitriou
Series	Dover Books On Computer Science
Condition	Unavailable
Binding Type	Paperback
Publisher	Dover Publications Inc.
Year published	2000-02-01
Number of pages	528
Cover note	Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
Note	Unavailable