O(depth)-Competitive Algorithm for Online Multi-level Aggregation

DOI10.1137/1.9781611974782.80zbMath1411.68201arXiv1701.01936OpenAlexW4240846525MaRDI QIDQ4575823

Ohad Talmon, Niv Buchbinder, Joseph (Seffi) Naor, Moran Feldman

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.01936

zbMATH Keywords

competitive analysisonline algorithmsaggregation of requests

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Caching with Time Windows and Delays ⋮ Unnamed Item ⋮ Online Algorithms for Multilevel Aggregation ⋮ New results on multi-level aggregation

This page was built for publication: O(depth)-Competitive Algorithm for Online Multi-level Aggregation