Improved approximation algorithms for hitting 3-vertex paths

08/30/2018
by   Samuel Fiorini, et al.
0

We study the problem of deleting a minimum cost set of vertices from a given vertex-weighted graph in such a way that the resulting graph has no induced path on three vertices. This problem is often called cluster vertex deletion in the literature and admits a straightforward 3-approximation algorithm since it is a special case of the vertex cover problem on a 3-uniform hypergraph. Recently, You, Wang, and Cao described an efficient 5/2-approximation algorithm for the unweighted version of the problem. Our main result is a 9/4-approximation algorithm for arbitrary weights, using the local ratio technique. We further conjecture that the problem admits a 2-approximation algorithm and give some support for the conjecture. This is in sharp contrast with the fact that the similar problem of deleting vertices to eliminate all triangles in a graph is known to be UGC-hard to approximate to within a ratio better than 3, as proved by Guruswami and Lee.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2020

Approximation algorithms for hitting subgraphs

Let H be a fixed undirected graph on k vertices. The H-hitting set probl...
research
09/23/2020

A simple (2+ε)-approximation algorithm for Split Vertex Deletion

A split graph is a graph whose vertex set can be partitioned into a cliq...
research
11/04/2020

Approximating the discrete time-cost tradeoff problem with bounded depth

We revisit the deadline version of the discrete time-cost tradeoff probl...
research
07/17/2020

The Combinatorial Santa Claus Problem or: How to Find Good Matchings in Non-Uniform Hypergraphs

We consider hypergraphs on vertices P∪ R where each hyperedge contains e...
research
01/19/2019

Approximation Algorithms for the A Priori TravelingRepairman

We consider the a priori traveling repairman problem, which is a stochas...
research
07/16/2020

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

We give the first 2-approximation algorithm for the cluster vertex delet...
research
03/14/2019

Multi-Robot Routing for Persistent Monitoring with Latency Constraints

In this paper we study a multi-robot path planning problem for persisten...

Please sign up or login with your details

Forgot password? Click here to reset