arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.0043cs.DMcs.CC
收藏

多重区间图中的Maximum Clique问题

The Maximum Clique Problem in Multiple Interval Graphs

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem

摘要:

多区间图是区间图的变体,其中每个顶点被分配一组实数线上的区间,而不是单个区间。我们研究了几类多重区间图的最大CLIQUE问题的复杂性。对于$t$ -区间图,当$t\geq 3$满足时,最大团问题是NP完全的;当$t=1$满足时,最大团问题是多项式时间可解的。这个问题也被认为是NP完全的$t$跟踪图时,$t\geq 4$和多项式时间可解时,$t\leq 2$。我们表明,最大CLIQUE已经是NP-完全的单位2-区间图和单位3-轨道图。进一步证明了该问题对于2-区间图、3-迹图、单位3-区间图和单位4-迹图都是APX-完全的。我们还引入了两类新的图,称为$t$ -循环区间图和$t$ -循环轨迹图,并研究了它们的最大CLIQUE问题的复杂性。在积极的一面,我们提出了一个多项式时间的$t$ -区间图上的加权最大CLIQUE的$t$ -近似算法,改进了早期的工作与近似比$4t$。

英文摘要:

Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple interval graphs. The MAXIMUM CLIQUE problem, or the problem of finding the size of the maximum clique, is known to be NP-complete for $t$-interval graphs when $t\geq 3$ and polynomial-time solvable when $t=1$. The problem is also known to be NP-complete in $t$-track graphs when $t\geq 4$ and polynomial-time solvable when $t\leq 2$. We show that MAXIMUM CLIQUE is already NP-complete for unit 2-interval graphs and unit 3-track graphs. Further, we show that the problem is APX-complete for 2-interval graphs, 3-track graphs, unit 3-interval graphs and unit 4-track graphs. We also introduce two new classes of graphs called $t$-circular interval graphs and $t$-circular track graphs and study the complexity of the MAXIMUM CLIQUE problem in them. On the positive side, we present a polynomial time $t$-approximation algorithm for WEIGHTED MAXIMUM CLIQUE on $t$-interval graphs, improving earlier work with approximation ratio $4t$.

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

↑