多项式稀疏子集的拟多项式时间逼近格式
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
摘要:
我们描述了如何近似,在准多项式时间,最大的多边形独立集,在一个给定的多边形集。我们的算法通过将Adamaszek和Wiese \cite{aw-asmwi-13, aw-qmwis-14}的结果推广到任意复杂度的多边形。令人惊讶的是,该算法还可以计算给定多边形集合中具有某种稀疏性条件的最大子集。例如,我们证明了可以近似多边形的最大子集,使得该子集的相交图不包含长度为$4$的循环(即,$K_{2,2}$)。
英文摘要:
We describe how to approximate, in quasi-polynomial time, the largest independent set of polygons, in a given set of polygons. Our algorithm works by extending the result of Adamaszek and Wiese \cite{aw-asmwi-13, aw-qmwis-14} to polygons of arbitrary complexity. Surprisingly, the algorithm also works or computing the largest subset of the given set of polygons that has some sparsity condition. For example, we show that one can approximate the largest subset of polygons, such that the intersection graph of the subset does not contain a cycle of length $4$ (i.e., $K_{2,2}$).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。