Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1807.03626

A note on the integrality gap of the configuration LP for restricted Santa Claus

Klaus Jansen·Lars Rohwedder
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the restricted Santa Claus problem we are given resources $\mathcal R$ and players $\mathcal P$. Every resource $j\in\mathcal R$ has a value $v_j$ and every player $i$ desires a set $\mathcal R(i)$ of resources. We are interested in distributing the resources to players that desire them. The quality of a solution is measured by the least happy player, i.e., the lowest sum of resource values. This value should be maximized. The local search algorithm by Asadpour et al. and its connection to the configuration LP has proved itself to be a very influential technique for this and related problems. In the original proof, a local search was used to obtain a bound of $4$ for the ratio of the fractional to the integral optimum of the configuration LP (integrality gap). This bound is non-constructive since the local search has not been shown to terminate in polynomial time. On the negative side, the worst instance known has an integrality gap of $2$. Although much progress was made in this area, neither bound has been improved since. We present a better analysis that shows the integrality gap is not worse than $3 + 5/6 \approx 3.8333$.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Klaus Jansen, Lars Rohwedder. 2018-07-10. A note on the integrality gap of the configuration LP for restricted Santa Claus. https://arxiv.org/abs/1807.03626

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗