Computing connected-$k$-subgraph cover with connectivity requirement

Cites Work

Unnamed Item
Unnamed Item
Approximation algorithms for minimum (weight) connected $k$-path vertex cover
A fixed-parameter algorithm for the vertex cover $P_3$ problem
PTAS for minimum $k$-path vertex cover in ball graph
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
On computing the minimum 3-path vertex cover and dissociation number of graphs
A primal-dual approximation algorithm for the vertex cover $P^3$ problem
Improved upper bounds for vertex cover
A faster FPT algorithm for 3-path vertex cover
An FPT algorithm for the vertex cover $P_4$ problem
Linearity of grid minors in treewidth with applications through bidimensionality
Treewidth. Computations and approximations
Fixed-parameter tractability of graph modification problems for hereditary properties
An efficient polynomial time approximation scheme for the vertex cover $P_3$ problem on planar graphs
PTAS for $\mathcal{H}$-free node deletion problems in disk graphs
Fixed-parameter algorithms for Vertex Cover $P_3$
A factor $2$ approximation algorithm for the vertex cover $P_3$ problem
Improved approximation algorithms for path vertex covers in regular graphs
Approximation algorithms for minimum weight connected 3-path vertex cover
Local search is a PTAS for feedback vertex set in minor-free graphs
Approximation algorithm for minimum weight connected-$k$-subgraph cover
Towards faster local search for minimum weight vertex cover on massive graphs
Minimum $k$-path vertex cover
Parameterized algorithm for 3-path vertex cover
Simple PTAS's for families of graphs excluding a minor
The vertex cover $P_3$ problem in cubic graphs
Approximation algorithm for the minimum weight connected $k$-subgraph cover problem
An $O^\ast ( 2 . 61 9^k )$ algorithm for \textsc{4-path vertex cover}
Graph Theory
Deterministic Parameterized Connected Vertex Cover
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
A linear-time approximation algorithm for the weighted vertex cover problem
Approximation Algorithms for the Set Covering and Vertex Cover Problems
A Separator Theorem for Nonplanar Graphs
Partitioning a Graph into Small Pieces with Applications to Path Transversal
A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
Polynomial-time Approximation Scheme for Minimum k-cut in Planar and Minor-free Graphs
Inapproximability of $H$-Transversal/Packing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Pseudorandom sets in Grassmann graph have near-perfect expansion

Computing connected-\(k\)-subgraph cover with connectivity requirement