Geometric Algorithms and Combinatorial Optimization

Authors:

ISBN: 978-3-642-97883-8 (Print) 978-3-642-97881-4 (Online)

Table of contents (11 chapters)

  1. Front Matter

    Pages I-XII

  2. No Access

    Book Chapter

    Pages 1-20

    Mathematical Preliminaries

  3. No Access

    Book Chapter

    Pages 21-45

    Complexity, Oracles, and Numerical Computation

  4. No Access

    Book Chapter

    Pages 46-63

    Algorithmic Aspects of Convex Sets: Formulation of the Problems

  5. No Access

    Book Chapter

    Pages 64-101

    The Ellipsoid Method

  6. No Access

    Book Chapter

    Pages 102-132

    Algorithms for Convex Bodies

  7. No Access

    Book Chapter

    Pages 133-156

    Diophantine Approximation and Basis Reduction

  8. No Access

    Book Chapter

    Pages 157-196

    Rational Polyhedra

  9. No Access

    Book Chapter

    Pages 197-224

    Combinatorial Optimization: Some Basic Examples

  10. No Access

    Book Chapter

    Pages 225-271

    Combinatorial Optimization: A Tour d’Horizon

  11. No Access

    Book Chapter

    Pages 272-303

    Stable Sets in Graphs

  12. No Access

    Book Chapter

    Pages 304-329

    Submodular Functions

  13. Back Matter

    Pages 331-364