集合覆盖不可逼近性结果的年表
A Chronology of Set Cover Inapproximability Results
摘要:
众所周知,存在一种算法,其在ln(n)的因子内近似集合覆盖的NP完全问题,并且最近证明了这种近似比是最佳的,除非P = NP。这个最优性结果是NP的特征化的许多进步的产物,在交互式证明系统和概率可检验证明(PCP)方面,以及对其分析的改进。然而,这样一来,很难从更大范围的证明系统分析中提取集覆盖近似界的发展。本文试图提出一个时间顺序的结果下界集覆盖的近似比。我们分析了一系列的证明逐步更好的界限和统一的结果下类似的术语和框架,提供一个准确的比较证明技术和他们的结果。我们还将许多初步结果视为黑盒,以更好地将我们的分析集中在Set Cover实例的核心约简上。其结果是几个硬度证明的替代版本,从最初的不可近似性结果开始,最终证明ln(n)是一个紧下界。
英文摘要:
It is well-known that an algorithm exists which approximates the NP-complete problem of Set Cover within a factor of ln(n), and it was recently proven that this approximation ratio is optimal unless P = NP. This optimality result is the product of many advances in characterizations of NP, in terms of interactive proof systems and probabilistically checkable proofs (PCP), and improvements to the analyses thereof. However, as a result, it is difficult to extract the development of Set Cover approximation bounds from the greater scope of proof system analysis. This paper attempts to present a chronological progression of results on lower-bounding the approximation ratio of Set Cover. We analyze a series of proofs of progressively better bounds and unify the results under similar terminologies and frameworks to provide an accurate comparison of proof techniques and their results. We also treat many preliminary results as black-boxes to better focus our analysis on the core reductions to Set Cover instances. The result is alternative versions of several hardness proofs, beginning with initial inapproximability results and culminating in a version of the proof that ln(n) is a tight lower bound.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。