The Design of Approximation Algorithms

  1. Home
  2. Bookstore
  3. The Design of Approximation Algorithms

The Design of Approximation Algorithms

By David P. Williamson

Rent or Buy eTextbook

Expires on Apr 23rd, 2022

Publisher List Price: $0.00

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.

Subject: Professional, Career & Trade -> Computer Science -> Algorithms

The Design of Approximation Algorithms
1st edition
Publisher: Cambridge University Press 4/26/11
Imprint: Cambridge University Press
Language: English

ISBN 10: 1139234730
ISBN 13: 9781139234733
Print ISBN: 9780521195270

Live Chats