The design of approximation algorithms / David P. Williamson, David B. Shmoys.
By: Williamson, David P.
Contributor(s): Shmoys, David Bernard.
New York : Cambridge University Press, 2011Description: xi, 504 p. : ill. ; 26 cm.ISBN: 9780521195270 (hardback).Subject(s): Approximation theory | Mathematical optimizationGenre/Form: Print books.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 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"--| Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|
| On Shelf | QA221 .W55 2011 (Browse shelf) | Available | AU0000000009248 |
Browsing Alfaisal University Shelves , Shelving location: On Shelf Close shelf browser
|
|
|
|
|
|
|
||
| QA188 .H66 2013 Matrix analysis, second edition | QA188 .H664 1991 Topics in matrix analysis / | QA188 .H664 1991 Topics in matrix analysis / | QA221 .W55 2011 The design of approximation algorithms / | QA241 .C6945 2015 A brief history of numbers / | QA241 .D37 2013 Computational number theory / | QA241 .D88 2010 Number theory : an elementary introduction through diophantine problems / |
Includes bibliographical references and indexes.
"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"--