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 条
  • [1] Parameterized complexity and approximation algorithms
    Marx, Daniel
    COMPUTER JOURNAL, 2008, 51 (01): : 60 - 78
  • [2] Parameterized complexity and approximation algorithms
    Marx, Dániel
    Computer Journal, 2008, 51 (01): : 60 - 78
  • [3] A survey of parameterized algorithms and the complexity of edge modification
    Crespelle, Christophe
    Drange, Pal Gronas
    V. Fomin, Fedor
    Golovach, Petr
    COMPUTER SCIENCE REVIEW, 2023, 48
  • [4] On the Parameterized and Approximation Hardness of Metric Dimension
    Hartung, Sepp
    Nichterlein, Andre
    2013 IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2013, : 266 - 276
  • [5] Complexity and parameterized algorithms for Cograph Editing
    Liu, Yunlong
    Wang, Jianxin
    Guo, Jiong
    Chen, Jianer
    THEORETICAL COMPUTER SCIENCE, 2012, 461 : 45 - 54
  • [6] Parameterized approximation algorithms for packing problems
    Zehavi, Meirav
    THEORETICAL COMPUTER SCIENCE, 2016, 648 : 40 - 55
  • [7] On parameterized approximation algorithms for balanced clustering
    Kong, Xiangyan
    Zhang, Zhen
    Feng, Qilong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [8] On parameterized approximation algorithms for balanced clustering
    Xiangyan Kong
    Zhen Zhang
    Qilong Feng
    Journal of Combinatorial Optimization, 2023, 45
  • [9] Algorithms and Hardness for Subspace Approximation
    Deshpande, Amit
    Tulsiani, Madhur
    Vishnoi, Nisheeth K.
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 482 - 496
  • [10] Parameterized complexity of k-anonymity: hardness and tractability
    Paola Bonizzoni
    Gianluca Della Vedova
    Riccardo Dondi
    Yuri Pirola
    Journal of Combinatorial Optimization, 2013, 26 : 19 - 43
12345