arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.3777cs.CC
收藏

改进的次模极大化的不可逼近性

Improved Inapproximability For Submodular Maximization

Per Austrin

摘要:

我们表明,它是唯一的游戏很难近似的最大值的子模函数的一个因素0.695内,它是唯一的游戏很难近似的最大值的对称子模函数的一个因素0.739内。这些结果略微改进了Feige,Mirrokni和Vondrák(FOCS 2007)之前的结果,他们表明这些问题分别在$3/4 + ε \approx 0.750$和$5/6 + ε \approx 0.833$内是NP难的。

英文摘要:

We show that it is Unique Games-hard to approximate the maximum of a submodular function to within a factor 0.695, and that it is Unique Games-hard to approximate the maximum of a symmetric submodular function to within a factor 0.739. These results slightly improve previous results by Feige, Mirrokni and Vondrák (FOCS 2007) who showed that these problems are NP-hard to approximate to within $3/4 + ε \approx 0.750$ and $5/6 + ε \approx 0.833$, respectively.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑