没有合适的资源?快使用搜索试试~ 我知道了~
首页近似算法(Approximation algorithms)
资源详情
资源评论
资源推荐
Vijay V. Vazirani
College of Computing
Georgia Institute of Technology
Copyright
c
2001
Approximation Algorithms
Springer
Berlin Heidelberg NewYork
Barcelona Hong Kong
London Milan Paris
Singapore Tokyo
To my parents
Preface
Although this may seem a paradox, all exact
science is dominated by the idea of approximation.
Bertrand Russell (1872–1970)
Most natural optimization problems, including those arising in important
application areas, are NP-hard. Therefore, under the widely believed con-
jecture that P = NP, their exact solution is prohibitively time consuming.
Charting the landscape of approximability of these problems, via polynomial
time algorithms, therefore becomes a compelling subject of scientific inquiry
in computer science and mathematics. This book presents the theory of ap-
proximation algorithms as it stands today. It is reasonable to expect the
picture to change with time.
The book is divided into three parts. In Part I we cover a combinato-
rial algorithms for a number of important problems, using a wide variety
of algorithm design techniques. The latter may give Part I a non-cohesive
appearance. However, this is to be expected – nature is very rich, and we
cannot expect a few tricks to help solve the diverse collection of NP-hard
problems. Indeed, in this part, we have purposely refrained from tightly cat-
egorizing algorithmic techniques so as not to trivialize matters. Instead, we
have attempted to capture, as accurately as possible, the individual character
of each problem, and point out connections between problems and algorithms
for solving them.
In Part II, we present linear programming based algorithms. These are
categorized under two fundamental techniques: rounding and the primal–
dual schema. But once again, the exact approximation guarantee obtainable
depends on the specific LP-relaxation used, and there is no fixed recipe for
discovering good relaxations, just as there is no fixed recipe for proving a the-
orem in mathematics (readers familiar with complexity theory will recognize
this as the philosophical point behind the P = NP question).
Part III covers four important topics. The first is the problem of finding
a shortest vector in a lattice which, for several reasons, deserves individual
treatment (see Chapter 27).
The second topic is the approximability of counting, as opposed to
optimization, problems (counting the number of solutions to a given in-
stance). The counting versions of all known NP-complete problems are #P-
complete
1
. Interestingly enough, other than a handful of exceptions, this is
true of problems in P as well. An impressive theory has been built for ob-
1
However, there is no theorem to this effect yet.
剩余395页未读,继续阅读
baiyanya
- 粉丝: 0
- 资源: 5
上传资源 快速赚钱
- 我的内容管理 收起
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
会员权益专享
最新资源
- ExcelVBA中的Range和Cells用法说明.pdf
- 基于单片机的电梯控制模型设计.doc
- 主成分分析和因子分析.pptx
- 共享笔记服务系统论文.doc
- 基于数据治理体系的数据中台实践分享.pptx
- 变压器的铭牌和额定值.pptx
- 计算机网络课程设计报告--用winsock设计Ping应用程序.doc
- 高电压技术课件:第03章 液体和固体介质的电气特性.pdf
- Oracle商务智能精华介绍.pptx
- 基于单片机的输液滴速控制系统设计文档.doc
- dw考试题 5套.pdf
- 学生档案管理系统详细设计说明书.doc
- 操作系统PPT课件.pptx
- 智慧路边停车管理系统方案.pptx
- 【企业内控系列】企业内部控制之人力资源管理控制(17页).doc
- 温度传感器分类与特点.pptx
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
评论1