The Design Approximation Algorithms David P. Williamson David B. … 9780521195270

Description: The Design of Approximation AlgorithmsDavid P. Williamson, David B. Shmoys Cambridge University Press Hardcover Unused and unread, minor cosmetic imperfections such as scuffing or minor creasing. Stamped 'damaged' by publisher to a non-text page. EAN: 9780521195270 Published 26/04/2011 Language: English 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. Part I. An Introduction to the Techniques 1. An introduction to approximation algorithms 2. Greedy algorithms and local search 3. Rounding data and dynamic programming 4. Deterministic rounding of linear programs 5. Random sampling and randomized rounding of linear programs 6. Randomized rounding of semidefinite programs 7. The primal-dual method 8. Cuts and metrics Part II. Further Uses of the Techniques 9. Further uses of greedy and local search algorithms 10. Further uses of rounding data and dynamic programming 11. Further uses of deterministic rounding of linear programs 12. Further uses of random sampling and randomized rounding of linear programs 13. Further uses of randomized rounding of semidefinite programs 14. Further uses of the primal-dual method 15. Further uses of cuts and metrics 16. Techniques in proving the hardness of approximation 17. Open problems Appendix A. Linear programming Appendix B. NP-completeness. DispatchIn stock here - same-day dispatch from England. My SKU: 3255627RefundsNo-hassle refunds are always available if your book is not as expected.Terms and Conditions of SaleSorry - no collections. All sales are subject to extended Terms and Conditions of Sale as well as the Return Policy and Payment Instructions. Visit my eBay Store for details andmany more books. Template layout and design, "JNC Academic Books", "needbooks", Copyright © JNC INC. Designated trademarks, layouts and brands are the property of their respective owners. All Rights Reserved.

Price: 38.99 GBP

Location: Welwyn

End Time: 2025-01-01T05:02:18.000Z

Shipping Cost: 125.83 GBP