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

常数逼近k-团是W[1]-困难的

Constant Approximating k-Clique is W[1]-hard

Bingkai Lin

摘要:

对于每个图$G$,令$ω(G)$是$G$中完全子图的最大尺寸。本文提出了一个简单的算法,它输入一个图$G$,一个正整数$k$和一个小常数$ε>0$,在$2^{Θ(k^5)}\cdot |G|^{O(1)}$ -时间内输出一个图$G'$和一个整数$k'$,使得(1)$k'\le 2^{Θ(k^5)}$,(2)如果$ω(G)\ge k$,则$ω(G')\ge k'$,(3)如果$ω(G)<k$,则$ω(G')< (1-ε)k'$ .这意味着对于任何常数$c\ge 1$和可计算函数$f$,没有$f(k)\cdot |G|^{O(1)}$ -时间算法可以区分情况$ω(G)\ge k$和$ω(G)<k/c$,除非$FPT= W[1]$。

英文摘要:

For every graph $G$, let $ω(G)$ be the largest size of complete subgraph in $G$. This paper presents a simple algorithm which, on input a graph $G$, a positive integer $k$ and a small constant $ε>0$, outputs a graph $G'$ and an integer $k'$ in $2^{Θ(k^5)}\cdot |G|^{O(1)}$-time such that (1) $k'\le 2^{Θ(k^5)}$, (2) if $ω(G)\ge k$, then $ω(G')\ge k'$, (3) if $ω(G)<k$, then $ω(G')< (1-ε)k'$. This implies that no $f(k)\cdot |G|^{O(1)}$-time algorithm can distinguish between the cases $ω(G)\ge k$ and $ω(G)<k/c$ for any constant $c\ge 1$ and computable function $f$, unless $FPT= W[1]$.

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

↑