Please Enter ISBN, Title or Author’s Name
Compare Textbook Prices with Amazon
Compare Textbook Prices with Chegg
Compare Textbook Prices with AbeBooks
Compare Textbook Prices with Vitalsource
Compare Textbook Prices with Valorebooks
and more...

The Design of Approximation Algorithms | 1 Edition

Compare Textbook Prices for The Design of Approximation Algorithms 1 Edition ISBN 9780521195270 by Williamson, David P.,Shmoys, David B.
Authors: Williamson, David P.,Shmoys, David B.
ISBN:0521195276
ISBN-13: 9780521195270
List Price: $63.00 (up to 6% savings)
Prices shown are the lowest from
the top textbook retailers.

View all Prices by Retailer

Details about The Design of Approximation Algorithms:

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.

Need Algorithms tutors? Start your search below:
Need Algorithms course notes? Start your search below: