《The Design of Approximation Algorithms》PDF电子书下载
《The Design of Approximation Algorithms》内容简介
David P. Williamson、David B. Shmoys / Cambridge University Press / 2011-4-26 / GBP 51.99 -
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.
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.
同类热门电子书下载更多
- 图论——一个迷人的世界
- Numerical Algorithms
- 算法（英文版•第4版）
- 面向算法设计的数据结构（C++语言版）
- Data Structure and Algorithmic Thinking with Python
- 计算机算法基础
- 信用风险评分卡研究
- Game Programming Algorithms and Techniques
- 并行计算
- 计算机程序设计艺术（第2卷）
- The Black Box Society
- 数据挖掘中的新方法：支持向量机
- 规划算法
- 离散数学及其应用(英文版·第5版)
- 机器学习基础教程
- 程序设计中实用的数据结构
- TopCoder Cookbook
- The Algorithm Design Manual
- ACM程序设计竞赛基础教程
- 程序设计中常用的解题策略