A tight approximation algorithm for the cluster vertex deletion problem

We give the first 2-approximation algorithm for the cluster vertex deletion problem. This approximation factor is tight, since approximating the problem within any constant factor smaller than 2 is UGC-hard. Our algorithm combines previous approaches, based on the local ratio technique and the manag...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 197; no. 2; pp. 1069 - 1091
Main Authors:	Aprile, Manuel, Drescher, Matthew, Fiorini, Samuel, Huynh, Tony
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2023 Springer
Subjects:	Algorithms Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Theoretical Twins Sherali-Adams hierarchy Linear programming relaxation Approximation algorithm Cluster vertex deletion
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!