Metraipolis › archive › dc_51cecd0dff78
Multi-Level Aggregation via Dual Fitting: An $O(D)$-Competitive Algorithm — arXiv:2608.04258
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04258
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:58:19.775Z
- SHA-256 of the archived text
9384cd58587e801fe18cb875929b6c1b61464c965df33da0bb23394278c6b18c- Stable URL of this page
https://metraipolis.com/documento/dc_51cecd0dff78
How to cite
Multi-Level Aggregation via Dual Fitting: An $O(D)$-Competitive Algorithm — arXiv:2608.04258 — arXiv (en), https://arxiv.org/abs/2608.04258 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_51cecd0dff78 (Metraipolis archive dc_51cecd0dff78, sha256 9384cd58587e801fe18cb875929b6c1b61464c965df33da0bb23394278c6b18c)
BibTeX
@misc{dc51cecd0dff78,
title = {Multi-Level Aggregation via Dual Fitting: An $O(D)$-Competitive Algorithm — arXiv:2608.04258},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04258},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_51cecd0dff78; sha256 9384cd58587e801fe18cb875929b6c1b61464c965df33da0bb23394278c6b18c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04258. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present a new online algorithm for the well-known Multi-Level Aggregation Problem (MLAP) with arbitrary delay functions, achieving a $2D$-competitive ratio, where $D$ is the depth of the underlying tree. This result improves the current best-known competitive ratio of $O(D^2)$ and asymptotically matches the $D$-competitive bound previously known only for the deadline variant, thereby closing the asymptotic gap between the two settings. Our key technical contribution is a novel dual fitting framework that provides a unified analysis for both settings; in particular, it also establishes a $D$-competitive ratio for MLAP with deadlines. Our analysis is built upon two new ideas: a hindsight dual construction, which resolves the infeasibility issues in traditional online primal-dual methods, and a time-dependent dual packing that maintains feasibility over dynamic request sets. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2608.04258 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-31T11:47:39.817Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).