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

子集问题的参数化(不)逼近性

Parameterized (in)approximability of subset problems

Edouard Bonnet, Vangelis Th. Paschos

摘要:

我们讨论了一类子集问题的FPT时间的逼近性和不可逼近性,其中可行解$S$是输入数据的子集,$S$的值是$|S|$。类处理包括许多著名的图,集,或可满足性问题,如支配集,顶点覆盖,集覆盖,独立集,反馈顶点集等,在第一次,我们引入的概念,广义的安全逼近和显示强大的参数化的不可逼近的许多子集处理的问题的结果。然后,我们研究了这些问题关于对偶参数$n-k$的可逼近性,其中$n$是实例的大小,$k$是标准参数。更确切地说,我们表明,在这样的参数化,许多这些问题,而W[ $\cdot$ ]硬,承认参数化的近似图式。

英文摘要:

We discuss approximability and inapproximability in FPT-time for a large class of subset problems where a feasible solution $S$ is a subset of the input data and the value of $S$ is $|S|$. The class handled encompasses many well-known graph, set, or satisfiability problems such as Dominating Set, Vertex Cover, Set Cover, Independent Set, Feedback Vertex Set, etc. In a first time, we introduce the notion of intersective approximability that generalizes the one of safe approximability and show strong parameterized inapproximability results for many of the subset problems handled. Then, we study approximability of these problems with respect to the dual parameter $n-k$ where $n$ is the size of the instance and $k$ the standard parameter. More precisely, we show that under such a parameterization, many of these problems, while W[$\cdot$]-hard, admit parameterized approximation schemata.

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

↑