Combinatorial Optimization: Algorithms and Complexity PDF Download Ebook. Christos H. Papadimitriou and Kenneth Steiglitz consider 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.

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.

It is useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. Christos Papadimitriou was born and raised in Athens, Greece, and studied in Athens and at Princeton. He has taught Computer Science at Harvard, MIT, Stanford, and, since 1996, at Berkeley, where he is the C. Lester Hogan Professor of Computer Science. In his research he uses mathematics to understand the power and limitations of computers.

He is a member of the National Academy of Sciences, the American Academy of Arts and Sciences, and the National Academy of Engineering. He has written several of the standard textbooks in algorithms and computation, and two novels: "Turing" and "Logicomix" (with Apostolos Doxiadis, art by Alecos Papadatos and Annie di Donna). He is working on his third novel, "Independence."

**More details about this book...**

or

**Download Combinatorial Optimization PDF Ebook**:

## No comments:

## Post a Comment