The design of approximation algorithms / David P. Williamson, David B. Shmoys.
Williamson, David P.| Call Number | 518/.5 |
| Author | Williamson, David P., author. |
| Title | The design of approximation algorithms / David P. Williamson, David B. Shmoys. |
| Physical Description | 1 online resource (xi, 504 pages) : digital, PDF file(s). |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Summary | Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. 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 section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. |
| Added Author | Shmoys, David Bernard, author. |
| Subject | APPROXIMATION THEORY. MATHEMATICAL OPTIMIZATION. |
| Multimedia |
Total Ratings:
0
02366nam a22003618i 4500
001
vtls001585054
003
VRT
005
20200921122300.0
006
m|||||o||d||||||||
007
cr||||||||||||
008
200921s2011||||enk o ||1 0|eng|d
020
$a 9780511921735 (ebook)
020
$z 9780521195270 (hardback)
035
$a (UkCbUP)CR9780511921735
039
9
$y 202009211223 $z santha
040
$a UkCbUP $b eng $e rda $c UkCbUP
050
0
0
$a QA221 $b .W55 2011
082
0
0
$a 518/.5 $2 22
100
1
$a Williamson, David P., $e author.
245
1
4
$a The design of approximation algorithms / $c David P. Williamson, David B. Shmoys.
264
1
$a Cambridge : $b Cambridge University Press, $c 2011.
300
$a 1 online resource (xi, 504 pages) : $b digital, PDF file(s).
336
$a text $b txt $2 rdacontent
337
$a computer $b c $2 rdamedia
338
$a online resource $b cr $2 rdacarrier
500
$a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
520
$a Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. 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 section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
650
0
$a APPROXIMATION THEORY.
650
0
$a MATHEMATICAL OPTIMIZATION.
700
1
$a Shmoys, David Bernard, $e author.
776
0
8
$i Print version: $z 9780521195270
856
4
0
$u https://doi.org/10.1017/CBO9780511921735
999
$a VIRTUA
No Reviews to Display
| Summary | Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. 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 section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems. |
| Notes | Title from publisher's bibliographic system (viewed on 05 Oct 2015). |
| Subject | APPROXIMATION THEORY. MATHEMATICAL OPTIMIZATION. |
| Multimedia |