Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) - Softcover

Book 18 of 19: Dover Books on Computer Science

Papadimitriou, Christos H.; Steiglitz, Kenneth

  • 4.08 out of 5 stars
    132 ratings by Goodreads
 
9780486402581: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Synopsis

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.

"synopsis" may belong to another edition of this title.

Other Popular Editions of the Same Title

9780131524620: Combinatorial Optimization: Algorithms and Complexity

Featured Edition

ISBN 10:  0131524623 ISBN 13:  9780131524620
Publisher: Prentice Hall, 1981
Hardcover