组合优化问题的逼近阈值
Approximation thresholds for combinatorial optimization problems
摘要：
一个NP难的组合优化问题$Π$被称为有一个{ \em近似阈值}，如果存在某个$t$，使得$Π$的最优值可以在多项式时间内在$t$的比率内近似，并且在比$t$更好的比率内近似它是NP难的。我们调查了一些已知的近似阈值的结果，并讨论了从已知的结果出现的模式。
英文摘要：
An NP-hard combinatorial optimization problem $Π$ is said to have an {\em approximation threshold} if there is some $t$ such that the optimal value of $Π$ can be approximated in polynomial time within a ratio of $t$, and it is NP-hard to approximate it within a ratio better than $t$. We survey some of the known approximation threshold results, and discuss the pattern that emerges from the known results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
