Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
Product Description
Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)
<DIV>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." — <I>American Mathematical Monthly.</I></DIV>
Technical Specifications
You might also like
Introduction to Graph Theory (Dover Books on Mathematics)
—
An Introduction to Information Theory: Symbols, Signals and Noise (Dover Books on Mathematics)
—
Deep Learning (Adaptive Computation and Machine Learning series)
—
Hands-On Machine Learning with Scikit-Learn and TensorFlow: Concepts, Tools, and Techniques to Build Intelligent Systems
—
A Book of Abstract Algebra: Second Edition
—
Probability Theory: A Concise Course (Dover Books on Mathematics)
—
Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems
—
Introduction to Topology: Third Edition (Dover Books on Mathematics)
—
The Go Programming Language (Addison-Wesley Professional Computing Series)
—
Number Theory (Dover Books on Mathematics)
—