Placing resources in a tree: Dynamic and static algorithms

DOI10.1007/3-540-60084-1_77zbMath1412.68076OpenAlexW2133734164MaRDI QIDQ4645181

Domenico Parente, Giuseppe Persiano, Vincenzo Auletta

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_77

zbMATH Keywords

binary treelinear-time algorithmoptimal placementcanonical functiondynamic version

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Data structures (68P05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Dynamic and static algorithms for optimal placement of resources in a tree
• A data structure for dynamic trees
• On the Complexity of Maintaining Partial Sums
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem

This page was built for publication: Placing resources in a tree: Dynamic and static algorithms