Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.08372

On Randomized Online Span Minimization

Adrian Calinescu·Gruia Calinescu·Peng-Jun Wan
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the online Busy Time scheduling model on a single machine of unbounded capacity, with non-preemptive jobs. In our setting, flexible jobs arrive online with a processing time and deadline, both of which become known to the algorithm at the job's arrival time. The goal is to schedule jobs on the machine to finish all jobs by their deadlines, so that the total time when the machine is turned on (busy time, also called span in this setting) is minimized. We present a randomized online algorithm with an exact competitive ratio of exactly (1 + e) < 3.72, where e is Euler's number, against an oblivious adversary, and show that no randomized algorithm can have a competitive ratio better than $e$ against an oblivious adversary. This lower bound holds even for algorithms that are allowed to restart jobs and are given lookahead. Previous work either dealt with special cases, or with deterministic algorithms, for which the known upper bound on the competitive ratio is 5 and the known lower bound is 4. Our findings offer fresh insights into randomization in online energy-aware scheduling. In the setting where jobs have uniform processing times, and a job that is started by the algorithm must be finished, we show that no deterministic algorithm can do better than 2, even when the jobs are agreeable. This deterministic lower bound also holds for uniform processing times and restarts in the scenario where a job's deadline is only revealed at its starting deadline. For Capacitated Busy Time with p_max-lookahead, we obtain a deterministic online algorithm with competitive ratio at most 8 and a randomized online algorithm with competitive ratio at most (4+ e) < 6.72, against an oblivious adversary.

Explore related subjects

cs.DS

Keep this discovery

BibTeXRIS

Adrian Calinescu, Gruia Calinescu, Peng-Jun Wan. 2026-08-08. On Randomized Online Span Minimization. https://arxiv.org/abs/2608.08372

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

Discover connections

cs.DS subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

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↗