eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-03-10
53:1
53:20
10.4230/LIPIcs.STACS.2021.53
article
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
Neuwohner, Meike
1
https://orcid.org/0000-0002-3664-3687
Research Institute for Discrete Mathematics, Universität Bonn, Germany
In this paper, we consider the task of computing an independent set of maximum weight in a given d-claw free graph G = (V,E) equipped with a positive weight function w:V → ℝ^+. Thereby, d ≥ 2 is considered a constant. The previously best known approximation algorithm for this problem is the local improvement algorithm SquareImp proposed by Berman [Berman, 2000]. It achieves a performance ratio of d/2+ε in time 𝒪(|V(G)|^(d+1)⋅(|V(G)|+|E(G)|)⋅(d-1)²⋅ (d/(2ε)+1)²) for any ε > 0, which has remained unimproved for the last twenty years. By considering a broader class of local improvements, we obtain an approximation ratio of d/2-(1/63,700,992)+ε for any ε > 0 at the cost of an additional factor of 𝒪(|V(G)|^(d-1)²) in the running time. In particular, our result implies a polynomial time d/2-approximation algorithm. Furthermore, the well-known reduction from the weighted k-Set Packing Problem to the Maximum Weight Independent Set Problem in k+1-claw free graphs provides a (k+1)/2 -(1/63,700,992)+ε-approximation algorithm for the weighted k-Set Packing Problem for any ε > 0. This improves on the previously best known approximation guarantee of (k+1)/2 + ε originating from the result of Berman [Berman, 2000].
https://drops.dagstuhl.de/storage/00lipics/lipics-vol187-stacs2021/LIPIcs.STACS.2021.53/LIPIcs.STACS.2021.53.pdf
d-Claw free Graphs
independent Set
local Improvement
k-Set Packing
weighted