Cargando…
The design of approximation algorithms /
"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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge ; New York :
Cambridge University Press,
©2011.
|
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | "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"-- |
|---|---|
| Descripción Física: | 1 online resource (xi, 504 pages) : illustrations |
| Bibliografía: | Includes bibliographical references and indexes. |
| ISBN: | 9781139077750 1139077759 9781139080040 1139080040 9780511921735 051192173X 1107214513 9781107214514 1283110962 9781283110969 1139075497 9781139075497 9786613110961 6613110965 1139082310 9781139082310 |