arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2009.11056math.COcs.DM
收藏

一个简单的$(2+ε)$ -近似法的顶点删除算法

A simple $(2+ε)$-approximation algorithm for Split Vertex Deletion

Matthew Drescher, Samuel Fiorini, Tony Huynh

摘要:

分裂图是指其顶点集可以划分为团集和稳定集的图。给定一个图$G$和权函数$w: V(G) \to \mathbb{Q}_{\geq 0}$,分裂顶点删除(SVD)问题要求找到一个最小权顶点集$X$,使得$G-X$是一个分裂图。很容易证明一个图是分裂图当且仅当它不包含$4$ -圈、$5$ -圈或两边匹配作为导出子图。因此,SVD承认一个简单的$5$近似算法。另一方面,对于每一个$δ>0$,SVD不承认一个$(2-δ)$ -近似算法,除非P=NP或唯一博弈猜想失败。对于每个$ε>0$,Lokshtanov,Misra,Panolan,Philip和Saurabh最近给出了SVD的随机$(2+ε)$近似算法。在这项工作中,我们给出了一个非常简单的确定性$(2+ε)$ -近似算法的SVD。

英文摘要:

A split graph is a graph whose vertex set can be partitioned into a clique and a stable set. Given a graph $G$ and weight function $w: V(G) \to \mathbb{Q}_{\geq 0}$, the Split Vertex Deletion (SVD) problem asks to find a minimum weight set of vertices $X$ such that $G-X$ is a split graph. It is easy to show that a graph is a split graph if and only it it does not contain a $4$-cycle, $5$-cycle, or a two edge matching as an induced subgraph. Therefore, SVD admits an easy $5$-approximation algorithm. On the other hand, for every $δ>0$, SVD does not admit a $(2-δ)$-approximation algorithm, unless P=NP or the Unique Games Conjecture fails. For every $ε>0$, Lokshtanov, Misra, Panolan, Philip, and Saurabh recently gave a randomized $(2+ε)$-approximation algorithm for SVD. In this work we give an extremely simple deterministic $(2+ε)$-approximation algorithm for SVD.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑