Design and Analysis of Approximation Algorithms

Authors:

ISBN: 978-1-4614-1700-2 (Print) 978-1-4614-1701-9 (Online)

Table of contents (10 chapters)

  1. Front Matter

    Pages i-xi

  2. No Access

    Chapter

    Pages 1-33

    Introduction

  3. No Access

    Chapter

    Pages 35-80

    Greedy Strategy

  4. No Access

    Chapter

    Pages 81-122

    Restriction

  5. No Access

    Chapter

    Pages 123-164

    Partition

  6. No Access

    Chapter

    Pages 165-209

    Guillotine Cut

  7. No Access

    Chapter

    Pages 211-244

    Relaxation

  8. No Access

    Chapter

    Pages 245-296

    Linear Programming

  9. No Access

    Chapter

    Pages 297-337

    Primal-Dual Schema and Local Ratio

  10. No Access

    Chapter

    Pages 339-370

    Semidefinite Programming

  11. No Access

    Chapter

    Pages 371-406

    Inapproximability

  12. Back Matter

    Pages 407-440