Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover

被引：0
|
作者：
Daniel Mölle
Stefan Richter
Peter Rossmanith
机构：
[1] RWTH Aachen University,Dept. of Comp. Sci.
来源：
Theory of Computing Systems | 2008年 / 43卷
关键词：
Exact algorithms; Parameterized complexity; Enumerate and expand; Vertex cover;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present a new method of solving graph problems related to Vertex Cover by enumerating and expanding appropriate sets of nodes. As an application, we obtain dramatically improved runtime bounds for two variants of the Vertex Cover problem. In the case of Connected Vertex Cover, we take the upper bound from O*(6k) to O*(2.7606k) without large hidden factors. For Tree Cover, we show a complexity of O*(3.2361k), improving over the previous bound of O*((2k)k). In the process, faster algorithms for solving subclasses of the Steiner tree problem on graphs are investigated.
引用
收藏
页码：234 / 253
页数：19
相关论文
共 50 条
  • [1] Enumerate and expand:: Improved algorithms for connected Vertex Cover and Tree Cover
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    [J]. THEORY OF COMPUTING SYSTEMS, 2008, 43 (02) : 234 - 253
  • [2] Enumerate and expand:: Improved algorithms for connected vertex cover and tree cover
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    [J]. COMPUTER SCIENCE - THEORY AND APPLICATIONS, 2006, 3967 : 270 - 280
  • [3] Enumerate and expand:: New runtime bounds for vertex cover variants
    Moelle, Daniel
    Richter, Stefan
    Rossmanith, Peter
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 265 - 273
  • [4] A 2-approximation NC algorithm for connected vertex cover and tree cover
    Fujito, T
    Doi, T
    [J]. INFORMATION PROCESSING LETTERS, 2004, 90 (02) : 59 - 63
  • [5] Improved approximation algorithms for connected sensor cover
    Stefan Funke
    Alex Kesselman
    Fabian Kuhn
    Zvi Lotker
    Michael Segal
    [J]. Wireless Networks, 2007, 13 : 153 - 164
  • [6] Improved approximation algorithms for connected sensor cover
    Funke, S
    Kesselman, A
    Lotker, Z
    Segal, M
    [J]. AD-HOC, MOBILE, AND WIRELESS NETWORKS, PROCEEDINGS, 2004, 3158 : 56 - 69
  • [7] Improved approximation algorithms for connected sensor cover
    Funke, Stefan
    Kesselman, Alex
    Kuhn, Fabian
    Lotker, Zvi
    Segal, Michael
    [J]. WIRELESS NETWORKS, 2007, 13 (02) : 153 - 164
  • [8] Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts
    Cornet, Alexis
    Laforest, Christian
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2017, 19 (03):
  • [9] Total domination, connected vertex cover and steiner tree with conflicts
    [J]. 2017, Discrete Mathematics and Theoretical Computer Science (19):
  • [10] Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
    R. Krithika
    Diptapriyo Majumdar
    Venkatesh Raman
    [J]. Theory of Computing Systems, 2018, 62 : 1690 - 1714
12345