Overview
- Spreads powerful algorithmic ideas developed in this area to practitioners
- Will accelerate progress in this area
- Raises algorithmic awareness of the scientific community by showing simple ways of expressing complex algorithmic ideas
- An indispensable cookbook for all serious mathematical programmers
- Includes supplementary material: sn.pub/extras
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
Similar content being viewed by others
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
- algorithm analysis and problem complexity
- combinatorics
Table of contents (30 chapters)
-
Introduction
-
Combinatorial Algorithms
Reviews
From the reviews:
"Approximation algorithms is an area where much progress has been made in the last 10 years. The book under review is a very good help for understanding these results. In each of the 27 chapters an important combinatorial optimization problem is presented and one or more approximation algorithms for it are clearly and concisely described and analyzed. In this way most of the most important results from the approximation algorithm literature are covered, often more easily comprehensible than the original articles." (Viggo Kann, Zentralblatt MATH, Vol. 1005, 2003)
"The book under review concentrates on the … design and analysis of efficient approximation algorithms with good performance guarantees. It is possibly the first textbook to provide an extensive and systematic coverage of this topic. … The book starts briskly, using simple examples to illustrate some of the key concepts and draw the reader rapidly in. … Copious exercises are included to test and deepen the reader’s understanding. … It deserves a place in every computer science and mathematical library." (Mark R. Jerrum, Mathematical Reviews, 2002 h)
"The book of Vijay Vazirani is not the first one dedicated to approximation algorithms … . However it is, I believe, among the very best from a didactical point of view: this is the text I would chose, would I have to give a course on approximation algorithms … . I suspect that for many researchers it would be the first one to consult … . It is a must acquisition for libraries of computer science/engineering departments … ." (Francesco Maffioli, Mathematical Methods of Operations Research, Vol. 56 (2), 2002)
"The book gives an overview on the theory of approximation algorithms. It presents the most important problems, the basic methods and ideas which are used in this area. … The book can be used for a graduate course on approximation algorithms. … The chapters also contain asection of exercises, which can help the students to understand the material in a deeper way. … On the other hand the book can be used by the researchers of the field … ." (Csanád Imreh, Acta Scientiarum Mathematicarum, Vol. 68, 2002)
Authors and Affiliations
Bibliographic Information
Book Title: Approximation Algorithms
Authors: Vijay V. Vazirani
DOI: https://doi.org/10.1007/978-3-662-04565-7
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2003
Hardcover ISBN: 978-3-540-65367-7Published: 02 July 2001
Softcover ISBN: 978-3-642-08469-0Published: 08 December 2010
eBook ISBN: 978-3-662-04565-7Published: 14 March 2013
Edition Number: 1
Number of Pages: XIX, 380
Topics: Theory of Computation, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Operations Research/Decision Theory, Combinatorics, Numeric Computing