skip to content
The design of approximation algorithms Preview this item
ClosePreview this item
Checking...

The design of approximation algorithms

Author: David P Williamson; David Bernard Shmoys
Publisher: New York : Cambridge University Press, 2011.
Edition/Format:   Print book : EnglishView all editions and formats
Summary:
"Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: David P Williamson; David Bernard Shmoys
ISBN: 9780521195270 0521195276
OCLC Number: 671709856
Awards: Winner of Lanchester Prize 2013
Description: xi, 504 pages : illustrations ; 26 cm
Contents: Machine generated contents note: I. An Introduction to the Techniques --
1. An Introduction to Approximation Algorithms --
1.1. The Whats and Whys of Approximation Algorithms --
1.2. An Introduction to the Techniques and to Linear Programming: The Set Cover Problem --
1.3. A Deterministic Rounding Algorithm --
1.4. Rounding a Dual Solution --
1.5. Constructing a Dual Solution: The Primal-Dual Method --
1.6. A Greedy Algorithm --
1.7. A Randomized Rounding Algorithm --
Exercises --
Chapter Notes --
2. Greedy Algorithms and Local Search --
2.1. Scheduling Jobs with Deadlines on a Single Machine --
2.2. The k-Center Problem --
2.3. Scheduling Jobs on Identical Parallel Machines --
2.4. The Traveling Salesman Problem --
2.5. Maximizing Float in Bank Accounts --
2.6. Finding Minimum-Degree Spanning Trees --
2.7. Edge Coloring --
Exercises --
Chapter Notes. 3. Rounding Data and Dynamic Programming --
3.1. The Knapsack Problem --
3.2. Scheduling Jobs on Identical Parallel Machines --
3.3. The Bin-Packing Problem --
Exercises --
Chapter Notes --
4. Deterministic Rounding of Linear Programs --
4.1. Minimizing the Sum of Completion Times on a Single Machine --
4.2. Minimizing the Weighted Sum of Completion Times on a Single Machine --
4.3. Solving Large Linear Programs in Polynomial Time via the Ellipsoid Method --
4.4. The Prize-Collecting Steiner Tree Problem --
4.5. The Uncapacitated Facility Location Problem --
4.6. The Bin-Packing Problem --
Exercises --
Chapter Notes --
5. Random Sampling and Randomized Rounding of Linear Programs --
5.1. Simple Algorithms for MAX SAT and MAX CUT --
5.2. Derandomization --
5.3. Flipping Biased Coins --
5.4. Randomized Rounding --
5.5. Choosing the Better of Two Solutions --
5.6. Nonlinear Randomized Rounding --
5.7. The Prize-Collecting Steiner Tree Problem. 5.8. The Uncapacitated Facility Location Problem --
5.9. Scheduling a Single Machine with Release Dates --
5.10. Chernoff Bounds --
5.11. Integer Multicommodity Flows --
5.12. Random Sampling and Coloring Dense 3-Colorable Graphs --
Exercises --
Chapter Notes --
6. Randomized Rounding of Semidefinite Programs --
6.1. A Brief Introduction to Semidefinite Programming --
6.2. Finding Large Cuts --
6.3. Approximating Quadratic Programs --
6.4. Finding a Correlation Clustering --
6.5. Coloring 3-Colorable Graphs --
Exercises --
Chapter Notes --
7. The Primal-Dual Method --
7.1. The Set Cover Problem: A Review --
7.2. Choosing Variables to Increase: The Feedback Vertex Set Problem in Undirected Graphs --
7.3. Cleaning Up the Primal Solution: The Shortest s-t Path Problem --
7.4. Increasing Multiple Variables at Once: The Generalized Steiner Tree Problem --
7.5. Strengthening Inequalities: The Minimum Knapsack Problem --
7.6. The Uncapacitated Facility Location Problem. 7.7. Lagrangean Relaxation and the k-Median Problem --
Exercises --
Chapter Notes --
8. Cuts and Metrics --
8.1. The Multiway Cut Problem and a Minimum-Cut --
Based Algorithm --
8.2. The Multiway Cut Problem and an LP Rounding Algorithm --
8.3. The Multicut Problem --
8.4. Balanced Cuts --
8.5. Probabilistic Approximation of Metrics by Tree Metrics --
8.6. An Application of Tree Metrics: Buy-at-Bulk Network Design --
8.7. Spreading Metrics, Tree Metrics, and Linear Arrangement --
Exercises --
Chapter Notes --
II. Further Uses of the Techniques --
9. Further Uses of Greedy and Local Search Algorithms --
9.1. A Local Search Algorithm for the Uncapacitated Facility Location Problem --
9.2. A Local Search Algorithm for the k-Median Problem --
9.3. Minimum-Degree Spanning Trees --
9.4. A Greedy Algorithm for the Uncapacitated Facility Location Problem --
Exercises --
Chapter Notes --
10. Further Uses of Rounding Data and Dynamic Programming. 10.1. The Euclidean Traveling Salesman Problem --
10.2. The Maximum Independent Set Problem in Planar Graphs --
Exercises --
Chapter Notes --
11. Further Uses of Deterministic Rounding of Linear Programs --
11.1. The Generalized Assignment Problem --
11.2. Minimum-Cost Bounded-Degree Spanning Trees --
11.3. Survivable Network Design and Iterated Rounding --
Exercises --
Chapter Notes --
12. Further Uses of Random Sampling and Randomized Rounding of Linear Programs --
12.1. The Uncapacitated Facility Location Problem --
12.2. The Single-Source Rent-or-Buy Problem --
12.3. The Steiner Tree Problem --
12.4. Everything at Once: Finding a Large Cut in a Dense Graph --
Exercises --
Chapter Notes --
13. Further Uses of Randomized Rounding of Semidefinite Programs --
13.1. Approximating Quadratic Programs --
13.2. Coloring 3-Colorable Graphs --
13.3. Unique Games --
Exercises --
Chapter Notes --
14. Further Uses of the Primal-Dual Method. 14.1. The Prize-Collecting Steiner Tree Problem --
14.2. The Feedback Vertex Set Problem in Undirected Graphs --
Exercises --
Chapter Notes --
15. Further Uses of Cuts and Metrics --
15.1. Low-Distortion Embeddings and the Sparsest Cut Problem --
15.2. Oblivious Routing and Cut-Tree Packings --
15.3. Cut-Tree Packings and the Minimum Bisection Problem --
15.4. The Uniform Sparsest Cut Problem --
Exercises --
Chapter Notes --
16. Techniques in Proving the Hardness of Approximation --
16.1. Reductions from NP-Complete Problems --
16.2. Reductions that Preserve Approximation --
16.3. Reductions from Probabilistically Checkable Proofs --
16.4. Reductions from Label Cover --
16.5. Reductions from Unique Games --
Chapter Notes --
17. Open Problems.
Responsibility: David P. Williamson, David B. Shmoys.
More information:

Abstract:

Designed as a textbook for graduate courses on algorithms, this book will also serve as a reference for researchers interested in heuristic solutions of discrete optimization problems. It presents  Read more...

Reviews

Editorial reviews

Publisher Synopsis

"This is a beautifully written book that will bring anyone who reads it to the current frontiers of research in approximation algorithms. It covers everything from the classics to the latest, most Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(5)

User lists with this item (2)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/671709856> # The design of approximation algorithms
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "671709856" ;
    library:placeOfPublication <http://dbpedia.org/resource/New_York_City> ; # New York
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/nyu> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/687616390#Topic/computers_programming_algorithms> ; # COMPUTERS--Programming--Algorithms
    schema:about <http://id.worldcat.org/fast/811829> ; # Approximation theory
    schema:about <http://experiment.worldcat.org/entity/work/data/687616390#Topic/matematisk_programmering> ; # Matematisk programmering
    schema:about <http://dewey.info/class/518.5/e22/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/687616390#Topic/approximationer> ; # Approximationer
    schema:about <http://id.worldcat.org/fast/1012099> ; # Mathematical optimization
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/77104538> ; # David Bernard Shmoys
    schema:creator <http://viaf.org/viaf/62337458> ; # David P. Williamson
    schema:datePublished "2011" ;
    schema:description ""Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems"--"@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/687616390> ;
    schema:image <http://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg> ;
    schema:inLanguage "en" ;
    schema:name "The design of approximation algorithms"@en ;
    schema:productID "671709856" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/671709856#PublicationEvent/new_york_cambridge_university_press_2011> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/687616390#Agent/cambridge_university_press> ; # Cambridge University Press
    schema:workExample <http://worldcat.org/isbn/9780521195270> ;
    umbel:isLike <http://bnb.data.bl.uk/id/resource/GBB0B9301> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/671709856> ;
    .


Related Entities

<http://dbpedia.org/resource/New_York_City> # New York
    a schema:Place ;
    schema:name "New York" ;
    .

<http://experiment.worldcat.org/entity/work/data/687616390#Agent/cambridge_university_press> # Cambridge University Press
    a bgn:Agent ;
    schema:name "Cambridge University Press" ;
    .

<http://experiment.worldcat.org/entity/work/data/687616390#Topic/computers_programming_algorithms> # COMPUTERS--Programming--Algorithms
    a schema:Intangible ;
    schema:name "COMPUTERS--Programming--Algorithms"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/687616390#Topic/matematisk_programmering> # Matematisk programmering
    a schema:Intangible ;
    schema:name "Matematisk programmering"@en ;
    .

<http://id.worldcat.org/fast/1012099> # Mathematical optimization
    a schema:Intangible ;
    schema:name "Mathematical optimization"@en ;
    .

<http://id.worldcat.org/fast/811829> # Approximation theory
    a schema:Intangible ;
    schema:name "Approximation theory"@en ;
    .

<http://viaf.org/viaf/62337458> # David P. Williamson
    a schema:Person ;
    schema:familyName "Williamson" ;
    schema:givenName "David P." ;
    schema:name "David P. Williamson" ;
    .

<http://viaf.org/viaf/77104538> # David Bernard Shmoys
    a schema:Person ;
    schema:familyName "Shmoys" ;
    schema:givenName "David Bernard" ;
    schema:name "David Bernard Shmoys" ;
    .

<http://worldcat.org/isbn/9780521195270>
    a schema:ProductModel ;
    schema:isbn "0521195276" ;
    schema:isbn "9780521195270" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.