The Constant Inapproximability of the Parameterized Dominating Set Problem

被引：13

作者：

Chen, Yijia ^{[1
]}

Lin, Bingkai ^{[2
]}

机构：

[1] Fudan Univ, Sch Comp Sci, Shanghai, Peoples R China

[2] JST, ERATO, Kawarabayashi Large Graph Project NII, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan

来源：

2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) | 2016年

关键词：

fpt inapproximability; dominating set; W[1; ETH; APPROXIMATION;

D O I：

10.1109/FOCS.2016.61

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We prove that there is no fpt-algorithm that can approximate the dominating set problem with any constant ratio, unless FPT = W[1]. Our hardness reduction is built on the second author's recent W[1]-hardness proof of the biclique problem [25]. This yields, among other things, a proof without the PCP machinery that the classical dominating set problem has no polynomial time constant approximation under the exponential time hypothesis.

引用

页码：505 / 514

页数：10

共 50 条

[21] Parameterized Inapproximability of Independent Set in H-Free Graphs
Dvorak, Pavel
Feldmann, Andreas Emil
Rai, Ashutosh
Rzazewski, Pawel
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2020, 2020, 12301 : 40 - 53
[22] Parameterized Complexity of Minimum Membership Dominating Set
Agrawal, Akanksha
Choudhary, Pratibha
Narayanaswamy, N. S.
Nisha, K. K.
Ramamoorthi, Vijayaragunathan
ALGORITHMICA, 2023, 85 (11) : 3430 - 3452
[23] NONBLOCKER: Parameterized algorithmics for MINIMUM DOMINATING SET
Dehne, F
Fellows, M
Fernau, H
Prieto, E
Rosamond, F
SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2006, 3831 : 237 - 245
[24] New Results on Polynomial Inapproximability and Fixed Parameter Approximability of EDGE DOMINATING SET
Escoffier, Bruno
Monnot, Jerome
Paschos, Vangelis Th.
Xiao, Mingyu
THEORY OF COMPUTING SYSTEMS, 2015, 56 (02) : 330 - 346
[25] New results on polynomial inapproximability and fixed parameter approximability of edge dominating set
PSL Research University, Université Paris-Dauphine, LAMSADE, France
不详
不详
Lect. Notes Comput. Sci., (25-36):
[26] The Parameterized Complexity of Dominating Set and Friends Revisited for Structured Graphs
Misra, Neeldhara
Rathi, Piyush
COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2019, 11532 : 299 - 310
[27] Parameterized edge dominating set in graphs with degree bounded by 3
Xiao, Mingyu
Nagamochi, Hiroshi
THEORETICAL COMPUTER SCIENCE, 2013, 508 : 2 - 15
[28] Parameterized Inapproximability of Degree Anonymization
Bazgan, Cristina
Nichterlein, Andre
PARAMETERIZED AND EXACT COMPUTATION, IPEC 2014, 2014, 8894 : 75 - 84
[29] Parameterized inapproximability of Morse matching
Bauer, Ulrich
Rathod, Abhishek
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2025, 126
[30] Parameterized Dynamic Variants of Red-Blue Dominating Set
Abu-Khzam, Faisal N.
Bazgan, Cristina
Fernau, Henning
SOFSEM 2020: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2020, 12011 : 236 - 247

← 1 2 3 4 5 →