
Faster parameterized algorithm for Cluster Vertex Deletion
In the Cluster Vertex Deletion problem the input is a graph G and an int...
read it

Improved approximation algorithms for hitting 3vertex paths
We study the problem of deleting a minimum cost set of vertices from a g...
read it

Towards constantfactor approximation for chordal / distancehereditary vertex deletion
For a family of graphs ℱ, Weighted ℱDeletion is the problem for which t...
read it

A simple (2+ε)approximation algorithm for Split Vertex Deletion
A split graph is a graph whose vertex set can be partitioned into a cliq...
read it

Partitioning Vectors into Quadruples: WorstCase Analysis of a MatchingBased Algorithm
Consider a problem where 4k given vectors need to be partitioned into k ...
read it

Faster branching algorithm for split to block vertex deletion
In the Split to Block Vertex Deletion (SBVD) problem the input is a spli...
read it

On Bayesian Network Approximation by Edge Deletion
We consider the problem of deleting edges from a Bayesian network for th...
read it
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
We give the first 2approximation algorithm for the cluster vertex deletion problem. This is tight, since approximating the problem within any constant factor smaller than 2 is UGChard. Our algorithm combines the previous approaches, based on the local ratio technique and the management of true twins, with a novel construction of a 'good' cost function on the vertices at distance at most 2 from any vertex of the input graph. As an additional contribution, we also study cluster vertex deletion from the polyhedral perspective, where we prove almost matching upper and lower bounds on how well linear programming relaxations can approximate the problem.
READ FULL TEXT
Comments
There are no comments yet.