2003

Approximation Algorithms

Authors:

ISBN: 978-3-642-08469-0 (Print) 978-3-662-04565-7 (Online)

Table of contents (30 chapters)

previous Page of 2
  1. Front Matter

    Pages I-XIX

  2. Introduction

    1. No Access

      Book Chapter

      Pages 1-11

      Introduction

  3. Combinatorial Algorithms

    1. Front Matter

      Pages 13-13

    2. No Access

      Book Chapter

      Pages 15-26

      Set Cover

    3. No Access

      Book Chapter

      Pages 27-37

      Steiner Tree and TSP

    4. No Access

      Book Chapter

      Pages 38-46

      Multiway Cut and k-Cut

    5. No Access

      Book Chapter

      Pages 47-53

      k-Center

    6. No Access

      Book Chapter

      Pages 54-60

      Feedback Vertex Set

    7. No Access

      Book Chapter

      Pages 61-67

      Shortest Superstring

    8. No Access

      Book Chapter

      Pages 68-73

      Knapsack

    9. No Access

      Book Chapter

      Pages 74-78

      Bin Packing

    10. No Access

      Book Chapter

      Pages 79-83

      Minimum Makespan Scheduling

    11. No Access

      Book Chapter

      Pages 84-89

      Euclidean TSP

  4. LP-Based Algorithms

    1. Front Matter

      Pages 91-91

    2. No Access

      Book Chapter

      Pages 93-107

      Introduction to LP-Duality

    3. No Access

      Book Chapter

      Pages 108-117

      Set Cover via Dual Fitting

    4. No Access

      Book Chapter

      Pages 118-123

      Rounding Applied to Set Cover

    5. No Access

      Book Chapter

      Pages 124-129

      Set Cover via the Primal-Dual Schema

    6. No Access

      Book Chapter

      Pages 130-138

      Maximum Satisfiability

    7. No Access

      Book Chapter

      Pages 139-144

      Scheduling on Unrelated Parallel Machines

    8. No Access

      Book Chapter

      Pages 145-153

      Multicut and Integer Multicommodity Flow in Trees

    9. No Access

      Book Chapter

      Pages 154-166

      Multiway Cut

    10. No Access

      Book Chapter

      Pages 167-178

      Multicut in General Graphs

previous Page of 2