Search arXiv⌕ Search

arXiv · 2611.09611

Online Timely Bin Packing Revisited: A Simpler Algorithm with Optimality in Special Cases

Abstract

Online Timely Bin Packing is a variant of classical online bin packing in which items arrive over time with sizes and deadlines. Packing an item may be deferred until its deadline, but once a collection of items is packed into a bin, the bin is closed and cannot be used again. The objective is to minimize the total number of bins used. The problem was introduced by Khattar in 2023. In 2025, Aminian proposed Discrete-Greedy, a deterministic online algorithm with a competitive ratio of exactly $2$, which remains the best-known upper bound. Its analysis is particularly simple; however, the algorithm requires maintaining a fractional simulation internally and may leave usable space in some bins unfilled. We propose Thrifty-Greedy, a simple deterministic online algorithm that does not require a fractional simulation. We prove that its competitive ratio is exactly $2$, matching the best-known upper bound. At the same time, the algorithm automatically achieves the optimal competitive ratio on two natural classes of inputs: it is $1$-competitive when all items have the same size, and $1.5$-competitive when every item has size in $\{1/3,2/3\}$. In contrast, Discrete-Greedy has a competitive ratio of at least $2$ on both classes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pei-Lin Chiang, Wing-Kai Hon, Ying-Chia Huang, Li-Tzu Yang. 2026-11-06. Online Timely Bin Packing Revisited: A Simpler Algorithm with Optimality in Special Cases. https://arxiv.org/abs/2611.09611

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

KEEP EXPLORING

Related papers

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications

Processing graphs with temporal information (the temporal graphs) has become increasingly important in the real world. In this paper, we study efficient solutions to temporal graph applications using new algorithms for Incremental Minimum Spanning Trees (MST). The first contribution of this work is to formally discuss how a broad set of setting-problem combinations of temporal graph processing can be solved using incremental MST, along with their theoretical guarantees. Despite the importance of the problem, we observe a gap between theory and practice for efficient incremental MST algorithms. While many classic data structures, such as the link-cut tree, provide strong bounds for incremental MST, their performance is limited in practice. Meanwhile, existing practical solutions used in applications do not have any non-trivial theoretical guarantees. Our second and main contribution includes new algorithms for incremental MST that are efficient both in theory and in practice. Our new data structure, the AM-tree, achieves the same theoretical bound as the link-cut tree for temporal graph processing and shows strong performance in practice. In our experiments, the AM-tree has competitive or better performance than existing practical solutions due to theoretical guarantees, and can be significantly faster than the link-cut tree (7.8-11x in updates and 7.7-13.7x in queries).

cs.DS↗

The Trichotomy of Regular Property Testing

Property testing is concerned with the design of algorithms making a sublinear number of queries to distinguish whether the input satisfies a given property or is far from having this property. A seminal paper of Alon, Krivelevich, Newman, and Szegedy in 2001 introduced property testing of formal languages: the goal is to determine whether an input word belongs to a given language, or is far from any word in that language. They constructed the first property testing algorithm for the class of all regular languages. This opened a line of work with improved complexity results and applications to streaming algorithms. In this work, we show a trichotomy result: the class of regular languages can be divided into three classes, each associated with an optimal query complexity. Our analysis, which reasons directly and combinatorially on automata, yields effective characterizations of all three classes using so-called minimal blocking sequences.

cs.DS↗

Approximate Total Weighted Completion Time with Convex Controllable Processing Times

We study the single-machine scheduling problem with controllable processing times to minimize the total weighted completion time, focusing on the setting where a job's processing time is a convex function of its allocated continuous resource. The computational complexity of this problem represents a long-standing open question, as it is currently neither known to be polynomial-time solvable nor NP-hard. While we do not fully resolve this complexity question, we provide several insights into the problem's approximability. On the positive side, we present a polynomial-time $e \le 2.719$-approximation algorithm, alongside a quasi-polynomial approximation scheme for instances where the largest parameter value is polynomially bounded by the instance size. On the negative side, we demonstrate that simple sorting rules, which are optimal for certain special cases in the literature, cannot guarantee a constant-factor approximation for the general case.

cs.DS↗