| 000 | 02452cam a22003374a 4500 | ||
|---|---|---|---|
| 999 |
_c54403 _d54403 |
||
| 001 | 16611561 | ||
| 005 | 20200123105008.0 | ||
| 008 | 110114s2011 nyua b 001 0 eng | ||
| 010 | _a 2011001945 | ||
| 020 | _a9780521195270 (hardback) | ||
| 020 | _a0521195276 (hardback) | ||
| 035 | _a(OCoLC)ocn671709856 | ||
| 040 |
_aDLC _cDLC _dYDX _dBTCTA _dYDXCP _dCDX _dGIKBM _dDLC |
||
| 042 | _apcc | ||
| 050 | 0 | 0 |
_aQA221 _b.W55 2011 |
| 082 | 0 | 0 |
_a518.5 WIL-D _222 |
| 084 |
_aCOM051300 _2bisacsh |
||
| 100 | 1 | _aWilliamson, David P. | |
| 245 | 1 | 4 |
_aThe design of approximation algorithms / _cDavid P. Williamson, David B. Shmoys. |
| 260 |
_aNew York : _bCambridge University Press, _c2011. |
||
| 300 |
_axi, 504 p. : _bill. ; _c26 cm. |
||
| 365 |
_aGBP _b51.99 |
||
| 504 | _aIncludes bibliographical references and indexes. | ||
| 520 | _a"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"-- | ||
| 650 | 0 | _aApproximation theory. | |
| 650 | 0 | _aMathematical optimization. | |
| 700 | 1 | _aShmoys, David Bernard. | |
| 856 | 4 | 2 |
_3Cover image _uhttp://assets.cambridge.org/97805211/95270/cover/9780521195270.jpg |
| 906 |
_a7 _bcbc _corignew _d1 _eecip _f20 _gy-gencatlg |
||
| 955 |
_bre10 2011-01-14 _cre10 2011-01-14 ONIX to STM _abc05 2011-06-21 1 copy rec'd., to CIP ver. |
||