Online algorithms for multi-level aggregation
DOI10.4230/LIPICS.ESA.2016.12zbMATH Open1397.68227arXiv1507.02378MaRDI QIDQ4606281FDOQ4606281
Authors: Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Lukáš Folwarczný, Łukasz Jeż, Jiří Sgall, Nguyen Kim Thang, Pavel Veselý, Marek Chrobak, Christoph Dürr
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1507.02378
Recommendations
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (7)
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost
- New results on multi-level aggregation
- Title not available (Why is that?)
- Caching with Time Windows and Delays
- Online Algorithms for Multilevel Aggregation
- Improved and deterministic online service with deadlines or delay
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
This page was built for publication: Online algorithms for multi-level aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606281)