# The design of approximation algorithms / David P. Williamson, David B. Shmoys.

##### By: Williamson, David P.

##### Contributor(s): Shmoys, David Bernard.

Material type: TextPublisher: New York : Cambridge University Press, 2011Description: xi, 504 p., USD 55.00 ill. ; 26 cm.ISBN: 9780521195270 (hardback); 0521195276 (hardback).Subject(s): Approximation theory | Mathematical optimizationDDC classification: 518/.5 Other classification: COM051300 Online resources: Cover image 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"--Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|

Book | Chennai Mathematical Institute General Stacks | 005.1 WIL (Browse shelf) | Checked out | 04/09/2023 | 7951 |

##### Browsing Chennai Mathematical Institute Shelves , Shelving location: General Stacks Close shelf browser

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"--