蒹葭苍苍,白露为霜。
所谓伊人,在水一方。

The Design of Approximation Algorithms - pdf - 电子书免费下载

内容提要:

Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. 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 part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.

ISBN:0521195276

年份:2011

总页数:516

语言:English

文件大小:4,65 MB

文件格式:PDF

下载:关注本站公众号(右侧二维码),在 个性化-联系客服 中输入本文链接可获取文件下载链接。

赞(0) 打赏
未经允许不得转载:酷居科技 » The Design of Approximation Algorithms - pdf - 电子书免费下载

评论 抢沙发

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址

锦瑟无端五十弦,一弦一柱思华年

酷居科技联系我们

觉得文章有用就打赏一下文章作者

支付宝扫一扫打赏

微信扫一扫打赏