Screen LibraryThe design of approximation algorithms
Saved in:
| Main Authors: | |
|---|---|
| Group Author: | |
| Published: |
Cambridge University Press,
|
| Publisher Address: | New York |
| Publication Dates: | 2011. |
| Literature type: | Book |
| Language: | English |
| Subjects: | |
| Carrier Form: | xi, 504 p.: ill. ; 26 cm. |
| ISBN: |
9780521195270 (hardback) 0521195276 (hardback) |
| Index Number: | O174 |
| CLC: | O174.41 |
| Call Number: | O174.41/W729 |
| Contents: |
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. "-- |