Placing resources in a tree: dynamic and static algorithms

DOI10.1007/3-540-60084-1_77zbMATH Open1412.68076OpenAlexW2133734164MaRDI QIDQ4645181FDOQ4645181

Authors: Mimmo Parente, Giuseppe Persiano, V. 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

Recommendations

• Dynamic and static algorithms for optimal placement of resources in a tree
• Optimal placement of identical resources in a tree
• Resource allocation in bounded degree trees
• scientific article; zbMATH DE number 1115549
• Experimental and Efficient Algorithms

zbMATH Keywords

binary treelinear-time algorithmoptimal placementcanonical functiondynamic version

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Optimal placement of identical resources in a tree

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

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