A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms

被引：24
|
作者：
Feldmann, Andreas Emil [1 ]
Karthik, C. S. [2 ]
Lee, Euiwoong [3 ]
Manurangsi, Pasin [4 ]
机构：
[1] Charles Univ Prague, Dept Appl Math KAM, Prague 11800, Czech Republic
[2] Tel Aviv Univ, Dept Comp Sci, IL-6997801 Tel Aviv, Israel
[3] NYU, Courant Inst Math Sci, New York, NY 10012 USA
[4] Google Res, Mountain View, CA 94043 USA
来源：
ALGORITHMS | 2020年 / 13卷 / 06期
基金：
以色列科学基金会;
关键词：
parameterized complexity; approximation algorithms; hardness of approximation; LOCAL SEARCH YIELDS; TOTAL FLOW-TIME; INDEPENDENT SET; K-MEANS; EFFICIENT APPROXIMATION; UNIFIED FRAMEWORK; STEINER TREE; LOWER BOUNDS; INAPPROXIMABILITY; APPROXIMABILITY;
D O I：
10.3390/a13060146
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and hardness perspectives, with emphasis on new techniques and potential future research directions.
引用
收藏
页数：60
相关论文
共 50 条
  • [41] Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees
    Chen, Jianer
    Fan, Jia-Hao
    Sze, Sing-Hoi
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, WG 2013, 2013, 8165 : 152 - 164
  • [42] Covering a tree with rooted subtrees - parameterized and approximation algorithms
    Chen, Lin
    Marx, Daniel
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2801 - 2820
  • [43] Parameterized and approximation algorithms for finding two disjoint matchings
    Chen, Zhi-Zhong
    Fan, Ying
    Wang, Lusheng
    THEORETICAL COMPUTER SCIENCE, 2014, 556 : 85 - 93
  • [44] Parameterized approximation algorithms for some location problems in graphs
    Leitert, Arne
    Dragan, Feodor F.
    THEORETICAL COMPUTER SCIENCE, 2019, 755 : 48 - 64
  • [45] Parameterized computation and complexity: A new approach dealing with NP-hardness
    Chen, JE
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2005, 20 (01) : 18 - 37
  • [46] On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
    Galvez, Waldo
    Grandoni, Fabrizio
    Jabal Ameli, Afrouz
    Sornat, Krzysztof
    THEORY OF COMPUTING SYSTEMS, 2021, 65 (06) : 985 - 1008
  • [47] Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness
    Jian-Er Chen
    Journal of Computer Science and Technology, 2005, 20 : 18 - 37
  • [48] On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
    Galvez, Waldo
    Grandoni, Fabrizio
    Ameli, Afrouz Jabal
    Sornat, Krzysztof
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2019), 2020, 11926 : 138 - 153
  • [49] On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
    Waldo Gálvez
    Fabrizio Grandoni
    Afrouz Jabal Ameli
    Krzysztof Sornat
    Theory of Computing Systems, 2021, 65 : 985 - 1008
  • [50] Approximation Algorithms and Hardness of Integral Concurrent Flow
    Chalermsook, Parinya
    Chuzhoy, Julia
    Ene, Alina
    Li, Shi
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 689 - 708
12345