An Improved Approximation for Maximum Weighted k-Set Packing

01/18/2023
by   Theophile Thiery, et al.
0

We consider the weighted k-set packing problem, in which we are given a collection of weighted sets, each with at most k elements and must return a collection of pairwise disjoint sets with maximum total weight. For k = 3, this problem generalizes the classical 3-dimensional matching problem listed as one of the Karp's original 21 NP-complete problems. We give an algorithm attaining an approximation factor of 1.786 for weighted 3-set packing, improving on the recent best result of 2-1/63,700,992 due to Neuwohner. Our algorithm is based on the local search procedure of Berman that attempts to improve the sum of squared weights rather than the problem's objective. When using exchanges of size at most k, this algorithm attains an approximation factor of k+1/2. Using exchanges of size k^2(k-1) + k, we provide a relatively simple analysis to obtain an approximation factor of 1.811 when k = 3. We then show that the tools we develop can be adapted to larger exchanges of size 2k^2(k-1) + k to give an approximation factor of 1.786. Although our primary focus is on the case k = 3, our approach in fact gives slightly stronger improvements on the factor k+1/2 for all k > 3. As in previous works, our guarantees hold also for the more general problem of finding a maximum weight independent set in a (k+1)-claw free graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/07/2021

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

We consider the Maximum Weight Independent Set Problem (MWIS) in d-claw ...
research
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...
research
05/13/2023

The 2-3-Set Packing problem and a 4/3-approximation for the Maximum Leaf Spanning Arborescence problem in rooted dags

The weighted 3-Set Packing problem is defined as follows: As input, we a...
research
08/14/2023

Approximations for the Steiner Multicycle Problem

The Steiner Multicycle problem consists of, given a complete graph, a we...
research
07/24/2019

P-SLOCAL-Completeness of Maximum Independent Set Approximation

We prove that the maximum independent set approximation problem with pol...
research
04/05/2023

Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing

We study the Min-Weighted Sum Bin Packing problem, a variant of the clas...
research
11/15/2022

On Sparsification of Stochastic Packing Problems

Motivated by recent progress on stochastic matching with few queries, we...

Please sign up or login with your details

Forgot password? Click here to reset