Enumerate and expand: Improved algorithms for connected vertex cover and tree cover

From MaRDI portal
Publication:929296

DOI10.1007/s00224-007-9089-3zbMath1148.68041OpenAlexW2076461672MaRDI QIDQ929296

Stefan Richter, Daniel Mölle, Peter Rossmanith

Publication date: 17 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9089-3




Related Items (27)

Unnamed ItemParameterized Power Vertex Cover\(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithmsFurther Exploiting c-Closure for FPT Algorithms and Kernels for Domination ProblemsOn the parameterized complexity of dynamic problemsThe connected vertex cover problem in \(k\)-regular graphsA parameterized approximation scheme for generalized partial vertex coverPolynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NPUnnamed ItemAn efficient heuristic algorithm for solving connected vertex cover problemConnected Vertex Covers in Dense GraphsComplexity and algorithms for the connected vertex cover problem in 4-regular graphsParameterized Complexity of Multi-Node HubsParameterized measure \& conquer for problems with no small kernelsFPT algorithms for connected feedback vertex setConnected vertex covers in dense graphsUnnamed ItemEnumerate and Measure: Improving Parameter Budget ManagementParameterized Complexity of Directed Steiner Tree on Sparse GraphsA relaxation of the directed disjoint paths problem: a global congestion metric helpsA Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps.Vertex and edge covers with clustering properties: Complexity and algorithmsParameterized algorithm for eternal vertex coverThe union of minimal hitting sets: parameterized combinatorial bounds and countingParameterized complexity of multi-node hubsRevising Johnson's table for the 21st centuryParameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices



Cites Work


This page was built for publication: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover