Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.18383

Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives

Thomas Kesselheim·Marco Molinaro·Kalen Patton·Sahil Singla
View original source ↗Read source document ↗Export metadata ↓

Abstract

Online Set Cover and Load Balancing are central problems in online optimization, and there is a long line of work on developing algorithms for these problems with convex objectives. Although we know optimal online algorithms with $\ell_p$-norm objectives, recent developments for general norms and convex objectives that rely on the online primal-dual framework apply only to fractional settings due to large integrality gaps. Our work focuses on directly designing integral online algorithms for Set Cover and Load Balancing with convex objectives, bypassing the convex-relaxation and the primal-dual technique. Some of the main implications are: 1. For Online Set Cover, we can extend the results of Azar et. al. (2016) for convex objectives and of Kesselheim, Molinaro, and Singla (2024) for symmetric norms from fractional to integral settings. 2. Our results for convex objectives and symmetric norms even apply to the online generalized scheduling problem, which generalizes both Set Cover and Load Balancing. Previous works could only handle the offline version of this problem with norm objectives (Deng, Li, and Rabani 2023). 3. Our methods easily extend to settings with disjoint-composition of norms. This allows us to recover or improve the norm-composition results of Nagarajan and Shen (2020), and Kesselheim, Molinaro, and Singla (2024), and to extend our results to a large class of norms beyond symmetric. Our approach is to first reduce these problems to online packing problems, and then to design good approximation algorithms for the latter. To solve these packing problems, we use two key ideas. First, we decouple the global packing problem into a series of local packing problems on different machines. Next, we choose random activation thresholds for machines such that conditional on a machine being activated, the expected number of jobs it covers is high compared to its cost.

Explore related subjects

cs.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Kesselheim, Marco Molinaro, Kalen Patton, Sahil Singla. 2025-08-25. Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives. https://arxiv.org/abs/2508.18383

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↗