矩形和线段的最大权独立集的参数化逼近
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments
摘要:
在矩形的最大权独立集问题(MWISR)中,给出了平面上平行于$n$轴的矩形的权集。任务是找到具有最大可能总权重的成对非重叠矩形的子集。这个问题是NP难的,最著名的多项式时间近似算法,由于Chalermsook和Walczak(SODA 2021),实现了近似因子$O(\log\log n )$。虽然在未加权设置中,由于Mitchell(FOCS 2021)和Gálvez等人(SODA 2022),常数因子近似算法是已知的,但将这些技术扩展到加权设置仍然是开放的。在本文中,我们认为MWISR通过参数化近似的镜头。Grandoni等人(ESA 2019)给出了一个运行时间为$k^{O(k/ε^8)} n^{O(1/ε^8)}$ time的$(1-ε)$近似算法,其中$k$是最优解中矩形的数量。不幸的是,他们的算法仅适用于未加权的设置,并且他们将其作为一个开放问题来给出加权设置中的参数化近似方案。我们的贡献是对Grandoni et al.(ESA 2019)公开问题的部分回答。我们给出了一个参数化的近似算法的MWISR,给定一个参数$k$,找到一组不重叠的矩形的重量至少$(1-ε) \text{opt}_k$在$2^{O(k \log(k/ε))} n^{O(1/ε)}$时间,其中$\text{opt}_k$是最大重量的基数在$k$的解决方案。请注意,因此,我们的算法可能会返回一个由多个$k$矩形组成的解决方案。为了弥补这一明显的弱点,我们还提出了一个参数化的近似计划与运行时间$2^{O(k^2 \log(k/ε))} n^{O(1)}$,找到一个解决方案的基数最多$k$和总重量至少$(1-ε)\text{opt}_k$的特殊情况下,轴平行段。
英文摘要:
In the Maximum Weight Independent Set of Rectangles problem (MWISR) we are given a weighted set of $n$ axis-parallel rectangles in the plane. The task is to find a subset of pairwise non-overlapping rectangles with the maximum possible total weight. This problem is NP-hard and the best-known polynomial-time approximation algorithm, due to by Chalermsook and Walczak (SODA 2021), achieves approximation factor $O(\log\log n )$. While in the unweighted setting, constant factor approximation algorithms are known, due to Mitchell (FOCS 2021) and to Gálvez et al. (SODA 2022), it remains open to extend these techniques to the weighted setting. In this paper, we consider MWISR through the lens of parameterized approximation. Grandoni et al. (ESA 2019) gave a $(1-ε)$-approximation algorithm with running time $k^{O(k/ε^8)} n^{O(1/ε^8)}$ time, where $k$ is the number of rectangles in an optimum solution. Unfortunately, their algorithm works only in the unweighted setting and they left it as an open problem to give a parameterized approximation scheme in the weighted setting. Our contribution is a partial answer to the open question of Grandoni et al. (ESA 2019). We give a parameterized approximation algorithm for MWISR that given a parameter $k$, finds a set of non-overlapping rectangles of weight at least $(1-ε) \text{opt}_k$ in $2^{O(k \log(k/ε))} n^{O(1/ε)}$ time, where $\text{opt}_k$ is the maximum weight of a solution of cardinality at most $k$. Note that thus, our algorithm may return a solution consisting of more than $k$ rectangles. To complement this apparent weakness, we also propose a parameterized approximation scheme with running time $2^{O(k^2 \log(k/ε))} n^{O(1)}$ that finds a solution with cardinality at most $k$ and total weight at least $(1-ε)\text{opt}_k$ for the special case of axis-parallel segments.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。