Geometric Algorithms and Combinatorial Optimization
Book information
Description
Front Matter....Pages I-XII Mathematical Preliminaries....Pages 1-20 Complexity, Oracles, and Numerical Computation....Pages 21-45 Algorithmic Aspects of Convex Sets: Formulation of the Problems....Pages 46-63 The Ellipsoid Method....Pages 64-101 Algorithms for Convex Bodies....Pages 102-132 Diophantine Approximation and Basis Reduction....Pages 133-156 Rational Polyhedra....Pages 157-196 Combinatorial Optimization: Some Basic Examples....Pages 197-224 Combinatorial Optimization: A Tour d’Horizon....Pages 225-271 Stable Sets in Graphs....Pages 272-303 Submodular Functions....Pages 304-329 Back Matter....Pages 331-364
Similar books
Combinatorics and Graph Theory
2008 · PDF
Computers and Intractability: A Guide to the Theory of NP-completeness
1979 · PDF
Graphs, Networks and Algorithms
2013 · PDF
Algebraic Graph Theory
2013 · PDF
Computers and Intractability: A Guide to the Theory of NP-completeness
1979 · PDF
A Course in Topological Combinatorics (Universitext)
2012 · PDF
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications
2006 · PDF
Covering Walks in Graphs
2014 · PDF