New results on multi-level aggregation
DOI10.1016/j.tcs.2021.02.016zbMath1497.68578OpenAlexW3129174835MaRDI QIDQ1998855
Jiří Sgall, Christoph Dürr, Marek Chrobak, Pavel Veselý, Lukáš Folwarczný, Martin Böhm, Łukasz Jeż, Nguyen Kim Thang, Jaroslaw Byrka, Marcin Bienkowski
Publication date: 9 March 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://wrap.warwick.ac.uk/148573/1/WRAP-new-results-multi-level-aggregation-Vesel%C3%BD-2021.pdf
Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the joint replenishment problem with deadlines
- Computational complexity of uncapacitated multi-echelon production planning problems
- Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- Incremental medians via online bidding
- Online Control Message Aggregation in Chain Networks
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer Problem
- A guessing game and randomized online algorithms
- On-line analysis of the TCP acknowledgment delay problem
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
- Improved Approximation Algorithm for the One-Warehouse Multi-Retailer Problem
- Improved Algorithms for Economic Lot Size Problems
- O(depth)-Competitive Algorithm for Online Multi-level Aggregation
- Online service with delay
- Online Algorithms for Multilevel Aggregation
- Better Approximation Bounds for the Joint Replenishment Problem
- Primal-Dual Algorithms for Deterministic Inventory Problems
This page was built for publication: New results on multi-level aggregation
