The Design of Approximation Algorithms (9780521195270)



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.


Product details

  • Hardback | 518 pages
  • 189 x 262 x 34mm | 1,120g
  • Cambridge, United Kingdom
  • English
  • Worked examples or Exercises; 86 Line drawings, unspecified
  • 0521195276
  • 9780521195270
  • 570,825


Download The Design of Approximation Algorithms (9780521195270).pdf, available at ebookdownloadfree.co for free.

GET FREE NOW

Komentar

Postingan populer dari blog ini

[PDF FREE] ひらがな日本美術史 1.pdf by 4104061018 書籍を無料ダウンロード

Advanced Engineering Mathematics (9780470646137)

[PDF FREE] じゃじゃ馬ならし・空騒ぎ (新潮文庫).pdf by 4102020098 書籍を 無料ダウンロード