The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader...
The Design of Approximation Algorithms
US$ 44.00
(+ tax)
Preview (read now)
Add to my own site
Give this ebook to a friend
Add to my wishlist
Author's page
Publisher's page
Devices
- iPhone / iPad
- Android phones & tablets
- Kindle Fire
- e-readers with Adobe Digital Editions installed
- PC
- Mac
See the full list
Available Devices
X
This book is available for the following devices:
- iPhone
- iPad
- Android
- Kindle Fire
- Windows
- Mac
- Sony Reader
- Cool-er Reader
- Nook
- Kobo Reader
- iRiver Story
File Formats
Download: EPUB or secure PDF.
You can also read this book online in eb20 format without having to download anything.
You can also read this book online in eb20 format without having to download anything.
Permissions
Printing
Copy/Paste
Read Aloud
Printing
Copy/Paste
Read Aloud
more
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.
less
Cambridge University Press; April 2011
520 pages; ISBN 9781139234733
Read online, or download in EPUB or secure PDF format
520 pages; ISBN 9781139234733
Read online, or download in EPUB or secure PDF format