• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (11): 83-90.

• 论文 • 上一篇    下一篇

近似算法之测度视角

王刚,骆志刚,李聪,黄旭慧   

  1. (国防科学技术大学计算机学院,湖南 长沙 410073)
  • 收稿日期:2010-11-10 修回日期:2011-12-20 出版日期:2012-11-25 发布日期:2012-11-25

Approximation Algorithms:A Measure Perspective

WANG Gang,LUO Zhigang,LI Cong,HUANG Xuhui   

  1. (School of Computer Science,National University of Defense Technology,Changsha 410073,China)
  • Received:2010-11-10 Revised:2011-12-20 Online:2012-11-25 Published:2012-11-25

摘要:

标准近似、微分近似和占优分析是三种不同的近似算法度量方法。标准近似比度量近似解偏离最优解的相对误差。微分近似关注近似解解值在最优解值和最差解值所形成的区间内所处的位置。占优分析考虑近似解在所有可行解中的排名。本文综述相关概念和主要成果,以及各测度方法的优缺点。尤其关注以PCP定理及唯一博弈猜想为代表的不可近似性成果。

关键词: 近似算法, 微分近似, 占优分析, 不可近似性

Abstract:

Standard approximation, differential approximation, and domination analysis are three different measures of approximation algorithms. The standard approximation ratio measures the relative error between the optimal solution and the approximate solution. Differential approximation pays attention to the position of the approximate solution in the interval defined by the optimal solution value and the worst solution value. Domination analysis considers the rank of the approximate solution among all feasible solutions. We survey concepts and main results in this domain, and also advantages and disadvantages of the three measures. Special focus has been placed on inapproximability results such as those based on the PCP theorem and the Unique Games Conjecture.

Key words: approximation algorithm;differential approximation;domination analysis;inapproximability