The Design of Approximation Algorithms

Nonfiction, Science & Nature, Mathematics, Computers, General Computing, Programming
Cover of the book The Design of Approximation Algorithms by David P. Williamson, David B. Shmoys, Cambridge University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: David P. Williamson, David B. Shmoys ISBN: 9781139234733
Publisher: Cambridge University Press Publication: April 26, 2011
Imprint: Cambridge University Press Language: English
Author: David P. Williamson, David B. Shmoys
ISBN: 9781139234733
Publisher: Cambridge University Press
Publication: April 26, 2011
Imprint: Cambridge University Press
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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Cambridge University Press

Cover of the book The Mamluk City in the Middle East by David P. Williamson, David B. Shmoys
Cover of the book Understanding Neuropsychiatric Disorders by David P. Williamson, David B. Shmoys
Cover of the book Cave Biology by David P. Williamson, David B. Shmoys
Cover of the book Socioeconomic and Environmental Impacts of Biofuels by David P. Williamson, David B. Shmoys
Cover of the book After Foucault by David P. Williamson, David B. Shmoys
Cover of the book Military Saints in Byzantium and Rus, 900–1200 by David P. Williamson, David B. Shmoys
Cover of the book Pragmatics by David P. Williamson, David B. Shmoys
Cover of the book Kurt Gödel and the Foundations of Mathematics by David P. Williamson, David B. Shmoys
Cover of the book Reduction and Emergence in Science and Philosophy by David P. Williamson, David B. Shmoys
Cover of the book The Arabic Print Revolution by David P. Williamson, David B. Shmoys
Cover of the book Anzac Battlefield by David P. Williamson, David B. Shmoys
Cover of the book The Cambridge Companion to Xenophon by David P. Williamson, David B. Shmoys
Cover of the book Handbook for Applied Modeling: Non-Gaussian and Correlated Data by David P. Williamson, David B. Shmoys
Cover of the book Concepts of Property in Intellectual Property Law by David P. Williamson, David B. Shmoys
Cover of the book Understanding Russian Politics by David P. Williamson, David B. Shmoys
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy