| Description |
1 online resource (xi, 504 pages) : illustrations |
| Physical Medium |
polychrome |
| Description |
text file |
| 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"-- Provided by publisher. |
| Bibliography |
Includes bibliographical references and indexes. |
| Contents |
An introduction to the techniques. An introduction to approximation algorithms -- Greedy algorithms and local search -- Rounding data and dynamic programming -- Deterministic rounding of linear programs -- Random sampling and randomized rounding of linear programs -- Randomized rounding of semidefinite programs -- The primal-dual method -- Cuts and metrics -- Further uses of the techniques. Further uses of greedy and local search algorithms -- Further uses of rounding data and dynamic programming -- Further uses of deterministic rounding of linear programs -- Further uses of random sampling and randomized rounding of linear programs -- Further uses of randomized rounding of semidefinite programs -- Further uses of the primal-dual method -- Further uses of cuts and metrics -- Techniques in proving the hardness of approximation -- Open problems -- Appendix A: Linear programming -- Appendix B: NP-completeness. |
| Local Note |
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America |
| Subject |
Approximation theory.
|
|
Approximation theory. |
|
Mathematical optimization.
|
|
Mathematical optimization. |
| Genre/Form |
Electronic books.
|
| Added Author |
Shmoys, David Bernard.
|
| Other Form: |
Print version: Williamson, David P. Design of approximation algorithms. New York : Cambridge University Press, 2011 9780521195270 (DLC) 2011001945 (OCoLC)671709856 |
| ISBN |
9781139077750 (electronic book) |
|
1139077759 (electronic book) |
|
9781139080040 (electronic book) |
|
1139080040 (electronic book) |
|
9780521195270 (hardback) |
|
0521195276 (hardback) |
|
