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

Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science) Cover Image
$22.95
Usually Ships in 1-5 Days

Description


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: 9780486402581
ISBN-10: 0486402584
Publisher: Dover Publications
Publication Date: January 29th, 1998
Pages: 528
Language: English
Series: Dover Books on Computer Science