 BROWSE
 USED
 STAFF PICKS
 GIFTS + GIFT CARDS
 SELL BOOKS
 BLOG
 EVENTS
 FIND A STORE
 800.878.7323

$21.95
New Trade Paper
Ships in 1 to 3 days
Available for Instore Pickup
in 7 to 12 days
More copies of this ISBNOther titles in the Dover Books on Computer Science series:
Combinatorial Optimization: Algorithms and Complexityby Christos H. Papadimitriou
Synopses & ReviewsPublisher Comments: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 NPcomplete problems; approximation algorithms, local search heuristics for NPcomplete problems, more. All chapters are supplemented by thoughtprovoking problems. A useful work for graduatelevel students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a selfcontained introduction need look no further." — American Mathematical Monthly. Book News Annotation: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 PrenticeHall, with a new preface.
Annotation c. Book News, Inc., Portland, OR (booknews.com) Synopsis:This graduatelevel text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NPcomplete problems; local search heuristics for NPcomplete problems, more. 1982 edition. Synopsis:This graduatelevel text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NPcomplete problems; local search heuristics for NPcomplete problems, more. 1982 edition. 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 NPcomplete problem
Synopsis:Clearly written graduatelevel text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NPcomplete problems; approximation algorithms, local search heuristics for NPcomplete problems, more. "Mathematicians wishing a selfcontained introduction need look no further." — American Mathematical Monthly. 1982 edition. .What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Other books you might likeRelated Subjects
Arts and Entertainment » Art » General


