Design and Analysis of Approximation Algorithms

  • Ding-Zhu Du
  • Ker-I Ko
  • Xiaodong Hu

Part of the Springer Optimization and Its Applications book series (SOIA, volume 62)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 1-33
  3. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 35-80
  4. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 81-122
  5. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 123-164
  6. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 165-209
  7. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 211-244
  8. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 245-296
  9. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 297-337
  10. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 339-370
  11. Ding-Zhu Du, Ker-I Ko, Xiaodong Hu
    Pages 371-406
  12. Back Matter
    Pages 407-440

About this book

Introduction

When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms.

 

There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach.

Keywords

NP-completeness approximation algorithms combinatorial optimization greedy algorithms linear programming

Authors and affiliations

  • Ding-Zhu Du
    • 1
  • Ker-I Ko
    • 2
  • Xiaodong Hu
    • 3
  1. 1., Dept. Computer ScienceUniversity of Texa, DallasRichardsonUSA
  2. 2., Department of Computer ScienceStony Brook UniversityStony BrookUSA
  3. 3.BeijingChina, People's Republic

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4614-1701-9
  • Copyright Information Springer Science+Business Media, LLC 2012
  • Publisher Name Springer, New York, NY
  • eBook Packages Mathematics and Statistics
  • Print ISBN 978-1-4614-1700-2
  • Online ISBN 978-1-4614-1701-9
  • Series Print ISSN 1931-6828
  • About this book