The Limits of Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

06/07/2021
by   Meike Neuwohner, et al.
0

We consider the Maximum Weight Independent Set Problem (MWIS) in d-claw free graphs, i.e. 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→ℝ_>0. For k≥ 1, the MWIS in k+1-claw free graphs generalizes the weighted k-Set Packing Problem. Given that for k≥ 3, this problem does not permit a polynomial time o(k/log k)-approximation unless P=NP, most previous algorithms for both weighted k-Set Packing and the MWIS in d-claw free graphs rely on local search. For the last twenty years, Berman's algorithm SquareImp, which yields a d/2+ϵ-approximation for the MWIS in d-claw free graphs, has remained unchallenged for both problems. Recently, it was improved by Neuwohner, obtaining an approximation guarantee slightly below d/2, and inevitably raising the question of how far one can get by using local search. In this paper, we finally answer this question asymptotically in the following sense: By considering local improvements of logarithmic size, we obtain approximation ratios of d-1+ϵ_d/2 for the MWIS in d-claw free graphs for d≥ 3 in quasi-polynomial time, where 0≤ϵ_d≤ 1 and lim_d→∞ϵ_d = 0. By employing the color coding technique, we can use the previous result to obtain a polynomial time k+ϵ_k+1/2-approximation for weighted k-Set Packing. On the other hand, we provide examples showing that no local improvement algorithm considering local improvements of size 𝒪(log(|𝒮|)) with respect to some power w^α of the weight function, where α∈ℝ is chosen arbitrarily, but fixed, can yield an approximation guarantee better than k/2 for the weighted k-Set Packing Problem with k≥ 3.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 3

page 5

page 7

page 13

page 15

page 17

page 19

page 39

02/02/2022

Passing the Limits of Pure Local Search for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

In this paper, we consider the task of computing an independent set of m...
06/07/2021

An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

In this paper, we consider the task of computing an independent set of m...
06/18/2020

Parameterized Inapproximability of Independent Set in H-Free Graphs

We study the Independent Set (IS) problem in H-free graphs, i.e., graphs...
04/25/2020

An algorithmic weakening of the Erdős-Hajnal conjecture

We study the approximability of the Maximum Independent Set (MIS) proble...
07/19/2018

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

We consider two optimization problems in planar graphs. In Maximum Weigh...
02/04/2020

The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics

Several important optimization problems in the area of vehicle routing c...
07/15/2020

Coloring and Maximum Weight Independent Set of Rectangles

In 1960, Asplund and Grünbaum proved that every intersection graph of ax...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.