A Constant-factor Approximation for Weighted Bond Cover

05/03/2021
by   Eun Jung Kim, et al.
0

The Weighted ℱ-Vertex Deletion for a class F of graphs asks, weighted graph G, for a minimum weight vertex set S such that G-S∈ F. The case when F is minor-closed and excludes some graph as a minor has received particular attention but a constant-factor approximation remained elusive for Weighted ℱ-Vertex Deletion. Only three cases of minor-closed F are known to admit constant-factor approximations, namely Vertex Cover, Feedback Vertex Set and Diamond Hitting Set. We study the problem for the class F of θ_c-minor-free graphs, under the equivalent setting of the Weighted c-Bond Cover problem, and present a constant-factor approximation algorithm using the primal-dual method. For this, we leverage a structure theorem implicit in [Joret et al., SIDMA'14] which states the following: any graph G containing a θ_c-minor-model either contains a large two-terminal protrusion, or contains a constant-size θ_c-minor-model, or a collection of pairwise disjoint constant-sized connected sets that can be contracted simultaneously to yield a dense graph. In the first case, we tame the graph by replacing the protrusion with a special-purpose weighted gadget. For the second and third case, we provide a weighting scheme which guarantees a local approximation ratio. Besides making an important step in the quest of (dis)proving a constant-factor approximation for Weighted ℱ-Vertex Deletion, our result may be useful as a template for algorithms for other minor-closed families.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/04/2022

Lossy Planarization: A Constant-Factor Approximate Kernelization for Planar Vertex Deletion

In the F-minor-free deletion problem we want to find a minimum vertex se...
research
10/16/2019

Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs

We consider node-weighted survivable network design (SNDP) in planar gra...
research
09/02/2020

Towards constant-factor approximation for chordal / distance-hereditary vertex deletion

For a family of graphs ℱ, Weighted ℱ-Deletion is the problem for which t...
research
06/13/2019

A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion

For a fixed finite family of graphs F, the F-Minor-Free Deletion problem...
research
10/05/2021

Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size

In the ℱ-Minor-Free Deletion problem one is given an undirected graph G,...
research
05/20/2020

The K-Centre Problem for Necklaces

In graph theory, the objective of the k-centre problem is to find a set ...
research
07/13/2018

A tight Erdős-Pósa function for planar minors

Let H be a planar graph. By a classical result of Robertson and Seymour,...

Please sign up or login with your details

Forgot password? Click here to reset