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

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

• 论文 • Previous Articles     Next Articles

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

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