Faster parameterized algorithm for pumpkin vertex deletion set

Tsur, Dekel

doi:10.1016/j.ipl.2019.03.009

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2022

Publication Types

Select...

Article3

Book2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

Aprile

Drescher

Fiorini

et al. 2021

Integer Programming and Combinatorial Optimization

View full text Add to dashboard Cite

We give the first 2-approximation algorithm for the cluster vertex deletion problem. This is tight, since approximating the problem within any constant factor smaller than 2 is UGC-hard. 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.

show abstract