Parameterized complexity of cardinality constrained optimization problems

被引:0
|
作者
Cai, Leizhen [1 ]
机构
[1] Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, Hong Kong
来源
Computer Journal | 2008年 / 51卷 / 01期
关键词
24;
D O I
暂无
中图分类号
学科分类号
摘要
Journal article (JA)
引用
收藏
页码:102 / 121
相关论文
共 50 条
  • [41] Parameterized Complexity of Eulerian Deletion Problems
    Marek Cygan
    Dániel Marx
    Marcin Pilipczuk
    Michał Pilipczuk
    Ildikó Schlotter
    Algorithmica, 2014, 68 : 41 - 61
  • [42] Parameterized complexity of constraint satisfaction problems
    Marx, D
    19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 139 - 149
  • [43] Parameterized Complexity of Secluded Connectivity Problems
    Fedor V. Fomin
    Petr A. Golovach
    Nikolay Karpov
    Alexander S. Kulikov
    Theory of Computing Systems, 2017, 61 : 795 - 819
  • [44] Incremental Problems in the Parameterized Complexity Setting
    Mans, Bernard
    Mathieson, Luke
    THEORY OF COMPUTING SYSTEMS, 2017, 60 (01) : 3 - 19
  • [45] The parameterized complexity of maximality and minimality problems
    Chen, Yijia
    Flum, Joerg
    PARAMETERIZED AND EXACT COMPUTATION, PROCEEDINGS, 2006, 4169 : 25 - 37
  • [46] PARAMETERIZED COMPLEXITY FOR GRAPH LAYOUT PROBLEMS
    Serna, Maria
    Thilikos, Dimitrios M.
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (86): : 41 - 65
  • [47] On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
    Jiang, Minghui
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2010, 6129 : 125 - 137
  • [48] Parameterized complexity of constraint satisfaction problems
    Marx, D
    COMPUTATIONAL COMPLEXITY, 2005, 14 (02) : 153 - 183
  • [49] Parameterized Complexity of Eulerian Deletion Problems
    Cygan, Marek
    Marx, Daniel
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Schlotter, Ildiko
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011, 6986 : 131 - +
  • [50] Parameterized Complexity of Directed Spanner Problems
    Fomin, Fedor, V
    Golovach, Petr A.
    Lochet, William
    Misra, Pranabendu
    Saurabh, Saket
    Sharma, Roohani
    ALGORITHMICA, 2022, 84 (08) : 2292 - 2308