The online set aggregation problem

DOI10.1007/978-3-319-77404-6_19MaRDI QIDQ2294691zbMATH OpenOpenAlexFDO

Authors Rodrigo A. Carrasco, Clifford Stein, José Verschae, Kirk Pruhs

Publication date 12 February 2020

Full work available at URL https://doi.org/10.1007/978-3-319-77404-6_19

zbMATH Keywords

competitive analysismultilevel aggregationonline algorithmsset aggregation

Mathematics Subject Classification ID

Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
• Online algorithms for multi-level aggregation
• Online Algorithms for Multilevel Aggregation
• The online set cover problem
• The online set cover problem

Cited in

(12)

• New results on multi-level aggregation
• \(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation
• Online algorithms for multi-level aggregation
• Online Algorithms for Multilevel Aggregation
• Optimal plans for aggregation
• Online Dominating Set
• scientific article; zbMATH DE number 7651147 (Why is no real title available?)
• Universal optimization for non-clairvoyant subadditive joint replenishment
• Online matching with delays and stochastic arrival times
• Universal optimization for non-clairvoyant subadditive joint replenishment
• Online matching with delays and size-based costs
• On the remote server problem or more about TCP acknowledgments

This page was built for publication: The online set aggregation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294691)