Combinatorial optimization: algorithms and complexity
(2013)
Nonfiction
eBook
Details
PUBLISHED
[United States] : Dover Publications : Made available through hoopla, 2013
DESCRIPTION
1 online resource
ISBN/ISSN
9780486320137 (electronic bk.) MWT11607196, 0486320138 (electronic bk.) 11607196
LANGUAGE
English
NOTES
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
Mode of access: World Wide Web