一类LP基算法的最优性
On the Optimality of a Class of LP-based Algorithms
摘要：
本文研究了一类包含顶点覆盖和独立集的填充与覆盖问题。通常，可以写出LP松弛，然后对解进行舍入。在本文中，我们解释了为什么简单的LP为基础的舍入算法的\\VC问题是最佳的假设UGC。补充Raghavendra的结果，我们的结果推广到一类严格的，覆盖/包装型CSP。
英文摘要：
In this paper we will be concerned with a class of packing and covering problems which includes Vertex Cover and Independent Set. Typically, one can write an LP relaxation and then round the solution. In this paper, we explain why the simple LP-based rounding algorithm for the \\VC problem is optimal assuming the UGC. Complementing Raghavendra's result, our result generalizes to a class of strict, covering/packing type CSPs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
