Paperlane

no. 3 · Tuesday 27 October 2026

Online Multi-Level Aggregation with Maximum Delay

Tianhang Lu, Runtian Ren, Shengcai Liu and Ke Tang

math.OC · v4

Abstract

We study Multi-Level Aggregation with Maximum Delay (MLA-MD) on finite weighted rooted trees. Each service pays for a rooted subtree and for the maximum waiting time among the requests it clears. For the offline problem, we give an exact polynomial-time algorithm that computes both the optimum and an optimal service schedule. For the online problem, we give a deterministic $2$-competitive algorithm and, against an oblivious adversary, a randomized $e/(e-1)$-competitive algorithm. Both competitive ratios are optimal, even on rooted paths. We also extend the offline result and both online guarantees to service systems with submodular costs.

fields
Optimization and Control
pdf ↗ page arXiv:2608.06796 ↗