Advertisement

© 2012

Design and Analysis of Approximation Algorithms

  • The technique-oriented approach provides a unified view of the design techniques for approximation algorithms

  • Detailed algorithms, as well as complete proofs and analyses, are presented for each technique

  • Numerous examples help the reader to better understand the design and analysis techniques

  • Collects a great number of applications, many from recent research papers

  • Includes a large collection of approximation algorithms of geometric problems

Textbook

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 algorithm analysis and problem complexity

Authors and affiliations

  1. 1., Dept. Computer ScienceUniversity of Texa, DallasRichardsonUSA
  2. 2., Department of Computer ScienceStony Brook UniversityStony BrookUSA
  3. 3.BeijingChina, People's Republic

About the authors

Ding-Zhu Du is co-editor of the first and soon-to-be published, second editions, of the Handbook of Combinatorial Optimization. He was also co-author with P.M. Pardalos and W. Wu of the Kluwer publication "Mathematical Theory of Optimization". Du will co-author upcoming Springer publications (2012) entitled "Connected Dominating Set: Theory and Applications" and "Introduction to Combinatorial Optimization". Prof. Du is also the EiC of the Journal of Combinatorial Optimization (Springer).

Ker-I Ko is a well known expert in the field of theoretical computer science. He has authored a single publication with Birkhauser "Computational Complexity of Real Functions" in 1991, with very good reviews. Prof. Du and Ker-I Ko have written several texts together including "Problem Solving in Automata, Languages, and Complexity" John Wiley, 2001; "Theory of Computational Complexity", John Wiley, 2000; Both of these books have received good reviews.

Xiaodong Hu is an expert in combinatorial optimization. He is a member of the editorial boards of Journal of Combinatorial Optimization and Discrete Mathematics, Algorithms and Applications.

Bibliographic information

Industry Sectors
Electronics
Engineering
Finance, Business & Banking
Law

Reviews

From the reviews:

“This book is intended for graduate courses of different levels, and course plans based on different chapter selections are proposed. Each chapter is accompanied by several pages of exercises and historical notes, setting the material and the references in context. The comprehensive bibliography covers a huge amount of literature in the heuristics and approximations area, as well as specific application problems. The index is detailed. This makes the book a good source for a course on approximation algorithms. ...For the more advanced reader the book seems to be an excellent in-depth resource on approximation algorithms, for their beginning up to the latest developments.”

—Gudula Runger, Computing Reviews

“It contains a large amount of precisely selected topics covering various aspects and design techniques related to approximation algorithms. … It has been intended as a textbook for a graduate course in theoretical computer science. … it can also be used as a reference book for postgraduate students and researchers in the area of design and analysis of algorithms. It also serves as a reference for established researchers by providing efficient tools for various applied areas like applied mathematics, engineering, medicine, economics, and other sciences.” (Vladimír Lacko, Zentralblatt MATH, Vol. 1237, 2012)

“This textbook organizes approximation algorithms into chapters based on the design techniques. … this book is particularly suited for students who, possibly starting from scratch, want to first encounter, then absorb, and finally master the main techniques which have emerged as general paradigms in the design of approximation algorithms. This includes self-study by novices … but also teaching by experts in standard courses.” (Romeo Rizzi, Mathematical Reviews, January, 2013)