ISBN-10:
3642084699
ISBN-13:
9783642084690
Pub. Date:
12/01/2010
Publisher:
Springer Berlin Heidelberg
Approximation Algorithms / Edition 1

Approximation Algorithms / Edition 1

by Vijay V. Vazirani

Paperback

View All Available Formats & Editions
Current price is , Original price is $79.99. You
Select a Purchase Option (Softcover reprint of hardcover 1st ed. 2001)
  • purchase options
    $74.44 $79.99 Save 7% Current price is $74.44, Original price is $79.99. You Save 7%.
  • purchase options

Overview

Approximation Algorithms / Edition 1

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.

Product Details

ISBN-13: 9783642084690
Publisher: Springer Berlin Heidelberg
Publication date: 12/01/2010
Edition description: Softcover reprint of hardcover 1st ed. 2001
Pages: 380
Product dimensions: 6.10(w) x 9.25(h) x 0.24(d)

Table of Contents

1 Introduction.- I. Combinatorial Algorithms.- 2 Set Cover.- 3 Steiner Tree and TSP.- 4 Multiway Cut and k-Cut.- 5 k-Center.- 6 Feedback Vertex Set.- 7 Shortest Superstring.- 8 Knapsack.- 9 Bin Packing.- 10 Minimum Makespan Scheduling.- 11 Euclidean TSP.- II. LP-Based Algorithms.- 12 Introduction to LP-Duality.- 13 Set Cover via Dual Fitting.- 14 Rounding Applied to Set Cover.- 15 Set Cover via the Primal—Dual Schema.- 16 Maximum Satisfiability.- 17 Scheduling on Unrelated Parallel Machines.- 18 Multicut and Integer Multicommodity Flow in Trees.- 19 Multiway Cut.- 20 Multicut in General Graphs.- 21 Sparsest Cut.- 22 Steiner Forest.- 23 Steiner Network.- 24 Facility Location.- 25 k-Median.- 26 Semidefinite Programming.- III. Other Topics.- 27 Shortest Vector.- 28 Counting Problems.- 29 Hardness of Approximation.- 30 Open Problems.- A An Overview of Complexity Theory for the Algorithm Designer.- A.3.1 Approximation factor preserving reductions.- A.4 Randomized complexity classes.- A.5 Self-reducibility.- A.6 Notes.- B Basic Facts from Probability Theory.- B.1 Expectation and moments.- B.2 Deviations from the mean.- B.3 Basic distributions.- B.4 Notes.- References.- Problem Index.

What People are Saying About This

Laszlo Lovasz

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.
Senior Researcher, Microsoft Research

Richard Karp

"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.
University of California at Berkeley

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews

Approximation Algorithms 5 out of 5 based on 0 ratings. 1 reviews.
Guest More than 1 year ago
Very good, it is easy to read the book if you have a good level of knowledge and the experience to think some details in the proofs of the theorems. I think it is a very good book for a graduate student.