Online algorithms for multi-level aggregation
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Recommendations
Cited in
(14)- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- New results on multi-level aggregation
- The online set aggregation problem
- \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
- Caching with time windows and delays
- Online Algorithms for Multilevel Aggregation
- scientific article; zbMATH DE number 7651147 (Why is no real title available?)
- Improved and deterministic online service with deadlines or delay
- Matheuristics for scheduling of maintenance service with linear operation cost and step function maintenance cost
- List update with delays or time windows
- Online matching with delays and stochastic arrival times
- Online multi-level aggregation with delays and stochastic arrivals
- Online matching with delays and size-based costs
- Nearly-optimal algorithm for non-clairvoyant service with delay
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)