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

Book 18 of 19: Dover Books on Computer Science

Christos H. Papadimitriou; Kenneth Steiglitz

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

Synopsis

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.

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

Synopsis

A text for a range of graduate courses, with some of the material suitable for students of computer science with a background in the theory of algorithms and some suitable for those with a background in operations research. Corrected and unabridged from the 1982 publication by Prentice-Hall, with a new preface. Annotation c. by Book News, Inc., Por

"About this title" 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, 1982
Hardcover