Combinatorial Optimization : Algorithms and Complexity

Christos H. Papadimitriou

ISBN 10: 0486402584 / ISBN 13: 9780486402581

Published by Dover Publications Inc., 2000

About this Item

Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.

Seller Inventory # 2121587/2

Bibliographic Details

• Title: Combinatorial Optimization : Algorithms and Complexity
• Publisher: Dover Publications Inc.
• Publication Date: 2000
• Language: English
• ISBN 10: 0486402584
• ISBN 13: 9780486402581
• Binding: Soft cover
• Condition: Sehr gut

About this title

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.