New results on multi-level aggregation
Authors:
- Marcin BienkowskiMBMarcin Bienkowski
- Martin BöhmMBMartin Böhm
- Jaroslaw ByrkaJBJaroslaw Byrka
- Marek ChrobakMCMarek Chrobak
- Christoph DürrCDChristoph Dürr
- Lukáš FolwarcznýLFLukáš Folwarczný
- Łukasz JeżŁJŁukasz Jeż
- Jiří SgallJSJiří Sgall
- Nguyen Kim ThangNTNguyen Kim Thang
- Pavel VeselýPVPavel Veselý
- 1 March 2021
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 861, 133-143
Abstract
No abstract availableKeywords
Funding Information
- National Science Foundation
- Agence Nationale de la Recherche
- European Research Council
- Narodowe Centrum Nauki
- Fondation Mathematiques Jacques Hadamard
- Czech Science Foundation
This publication has 14 references indexed in Scilit:
- Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait?Algorithmica, 2011
- Latency-constrained aggregation in sensor networksACM Transactions on Algorithms, 2009
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINESDiscrete Mathematics, Algorithms and Applications, 2009
- A Constant Approximation Algorithm for the One-Warehouse Multiretailer ProblemManagement Science, 2008
- Incremental Medians via Online BiddingAlgorithmica, 2007
- SIGACT news online algorithms column 10ACM SIGACT News, 2006
- Primal-Dual Algorithms for Deterministic Inventory ProblemsMathematics of Operations Research, 2006
- Dynamic TCP Acknowledgment and Other Stories about e/(e - 1)Algorithmica, 2003
- On-line analysis of the TCP acknowledgment delay problemJournal of the ACM, 2001
- Computational complexity of uncapacitated multi-echelon production planning problemsOperations Research Letters, 1989