Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity

by Christos H. Papadimitriou, Kenneth Steiglitz
     
 

View All Available Formats & Editions

ISBN-10: 0486402584

ISBN-13: 9780486402581

Pub. Date: 01/29/1998

Publisher: Dover Publications


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

Overview


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.

Product Details

ISBN-13:
9780486402581
Publisher:
Dover Publications
Publication date:
01/29/1998
Series:
Dover Books on Computer Science Series
Edition description:
Unabridged
Pages:
528
Sales rank:
565,402
Product dimensions:
5.48(w) x 8.47(h) x 1.04(d)

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >