Title: Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Publisher: Dover Publications
Publication Date: 1998
Language: English
ISBN 10: 0486402584
ISBN 13: 9780486402581
Binding: Soft cover
Condition: Good

About this title

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

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.

Store Description

We offer a wide variety of books including fiction and non-fiction titles.

Visit Seller's Storefront

Seller's business information

SBYB, Inc.
900 Knell Rd, Montgomery, IL, 60538, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

Shipping Terms

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.