近似:独立集 implies 顶点覆盖
Approximately: Independence Implies Vertex Cover
AI总结:
通过将独立集近似算法转换为顶点覆盖近似算法,获得平面中无权伪盘、轴对齐矩形和加权多边形的顶点覆盖近似算法新结果。
摘要:
我们观察到,一个针对独立集的(1-ε)近似算法,能够处理输入图的任意诱导子图,可以通过多项式时间归约提供一个(1+ε)近似的顶点覆盖算法。这一基本观察之前已有人提出,见[BHR11]。作为结果,我们得到对于无权伪盘的VC的PTAS,对于无权轴对齐矩形在平面中的VC的QQPTAS,以及对于平面中加权多边形的MWVC的QPTAS。据我们所知,这些结果都是新的。
英文摘要:
$\newcommand{\eps}{\varepsilon}$ We observe that a $(1-\eps)$-approximation algorithm to Independent Set, that works for any induced subgraph of the input graph, can be used, via a polynomial time reduction, to provide a $(1+\eps)$-approximation to Vertex Cover. This basic observation was made before, see [BHR11]. As a consequence, we get a PTAS for VC for unweighted pseudo-disks, QQPTAS for VC for unweighted axis-aligned rectangles in the plane, and QPTAS for MWVC for weighted polygons in the plane. To the best of our knowledge all these results are new.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。