Advertisement

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Introduction

    1. Vijay V. Vazirani
      Pages 1-11
  3. Combinatorial Algorithms

    1. Front Matter
      Pages 13-13
    2. Vijay V. Vazirani
      Pages 15-26
    3. Vijay V. Vazirani
      Pages 27-37
    4. Vijay V. Vazirani
      Pages 38-46
    5. Vijay V. Vazirani
      Pages 47-53
    6. Vijay V. Vazirani
      Pages 54-60
    7. Vijay V. Vazirani
      Pages 61-67
    8. Vijay V. Vazirani
      Pages 68-73
    9. Vijay V. Vazirani
      Pages 74-78
    10. Vijay V. Vazirani
      Pages 79-83
    11. Vijay V. Vazirani
      Pages 84-89
  4. LP-Based Algorithms

    1. Front Matter
      Pages 91-91
    2. Vijay V. Vazirani
      Pages 93-107
    3. Vijay V. Vazirani
      Pages 108-117
    4. Vijay V. Vazirani
      Pages 118-123
    5. Vijay V. Vazirani
      Pages 124-129
    6. Vijay V. Vazirani
      Pages 130-138
    7. Vijay V. Vazirani
      Pages 139-144
    8. Vijay V. Vazirani
      Pages 145-153
    9. Vijay V. Vazirani
      Pages 154-166
    10. Vijay V. Vazirani
      Pages 167-178
    11. Vijay V. Vazirani
      Pages 179-196
    12. Vijay V. Vazirani
      Pages 197-211
    13. Vijay V. Vazirani
      Pages 212-230
    14. Vijay V. Vazirani
      Pages 231-241
    15. Vijay V. Vazirani
      Pages 242-254
    16. Vijay V. Vazirani
      Pages 255-269
  5. Other Topics

    1. Front Matter
      Pages 271-271
    2. Vijay V. Vazirani
      Pages 273-293
    3. Vijay V. Vazirani
      Pages 294-305
    4. Vijay V. Vazirani
      Pages 306-333
    5. Vijay V. Vazirani
      Pages 334-343
  6. Back Matter
    Pages 344-380

About this book

Introduction

 This book covers the dominant theoretical approaches to the approximate solution of hard combinatorial optimization and enumeration problems. It contains elegant combinatorial theory, useful and interesting algorithms, and deep results about the intrinsic complexity of combinatorial problems. Its clarity of exposition and excellent selection of exercises will make it accessible and appealing to all those with a taste for mathematics and algorithms.

Richard Karp,University Professor, University of California at Berkeley

Following the development of basic combinatorial optimization techniques in the 1960s and 1970s, a main open question was to develop a theory of approximation algorithms. In the 1990s, parallel developments in techniques for designing approximation algorithms as well as methods for proving hardness of approximation results have led to a beautiful theory. The need to solve truly large instances of computationally hard problems, such as those arising from the Internet or the human genome project, has also increased interest in this theory. The field is currently very active, with the toolbox of approximation algorithm design techniques getting always richer.

It is a pleasure to recommend Vijay Vazirani's well-written and comprehensive book on this important and timely topic. I am sure the reader will find it most useful both as an introduction to approximability as well as a reference to the many aspects of approximation algorithms.

László Lovász, Senior Researcher, Microsoft Research

Keywords

Approximation algorithms Combinatorial optimization Computer Erfüllbarkeitsproblem der Aussagenlogik NP-complete problems Operations Research Scheduling algorithm design algorithms complexity complexity theory linear optimization optimization programming

Authors and affiliations

  • Vijay V. Vazirani
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-04565-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-08469-0
  • Online ISBN 978-3-662-04565-7
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications