B $_1$ - VPG和B $_1$ - EPG图的独立性和控制性的近似算法
Approximation Algorithms for Independence and Domination on B$_1$-VPG and B$_1$-EPG Graphs
摘要:
图$G$被称为B $_k$ -VPG(分别地,B $_k$ -EPG),对于某个常数$k\geq 0$,如果它在网格上具有字符串表示,使得每个顶点是具有至多$k$弯曲的正交路径,并且两个顶点在$G$中相邻当且仅当对应的字符串相交(分别,对应的串共享至少一个网格边缘)。如果B $_k$ -VPG图的两个相邻字符串恰好相交一次,则该图称为单字符串B $_k$ -VPG图。本文研究了B $_1$ -VPG和B $_1$ -EPG图上的最大独立集和最小控制集问题。首先,我们给出了一个简单的$O(\log n)$ -近似算法,用于解决B $_1$图上的最大独立集问题,改进了Lahiri等人(COCOA 2015)之前的$O((\log n)^2)$ -近似算法。然后,我们考虑最小控制集问题。我们给出了一个单字符串B $_1$ -VPG图上该问题的$O(1)$ -近似算法,为该问题提供了第一个常数因子近似算法.此外,我们表明,最小支配集问题是APX硬B $_1$ -EPG图,排除了PTAS的可能性,除非P=NP。最后,我们给出了该问题在B $_1$ -EPG图的两个非平凡子类上的常数因子近似算法。据我们所知,这些是B $_1$ -EPG图上最小支配集问题的第一个结果,部分回答了Epstein等人提出的问题。(WADS 2013)。
英文摘要:
A graph $G$ is called B$_k$-VPG (resp., B$_k$-EPG), for some constant $k\geq 0$, if it has a string representation on a grid such that each vertex is an orthogonal path with at most $k$ bends and two vertices are adjacent in $G$ if and only if the corresponding strings intersect (resp., the corresponding strings share at least one grid edge). If two adjacent strings of a B$_k$-VPG graph intersect exactly once, then the graph is called a one-string B$_k$-VPG graph. In this paper, we study the Maximum Independent Set and Minimum Dominating Set problems on B$_1$-VPG and B$_1$-EPG graphs. We first give a simple $O(\log n)$-approximation algorithm for the Maximum Independent Set problem on B$_1$-VPG graphs, improving the previous $O((\log n)^2)$-approximation algorithm of Lahiri et al. (COCOA 2015). Then, we consider the Minimum Dominating Set problem. We give an $O(1)$-approximation algorithm for this problem on one-string B$_1$-VPG graphs, providing the first constant-factor approximation algorithm for this problem. Moreover, we show that the Minimum Dominating Set problem is APX-hard on B$_1$-EPG graphs, ruling out the possibility of a PTAS unless P=NP. Finally, we give constant-factor approximation algorithms for this problem on two non-trivial subclasses of B$_1$-EPG graphs. To our knowledge, these are the first results for the Minimum Dominating Set problem on B$_1$-EPG graphs, partially answering a question posed by Epstein et al. (WADS 2013).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。