Dynamic and static algorithms for optimal placement of resources in a tree

DOI10.1016/0304-3975(96)00089-8zbMath0872.68139OpenAlexW2007921877MaRDI QIDQ671529

Domenico Parente, Giuseppe Persiano, Vincenzo Auletta

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(96)00089-8

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Efficient algorithms for centers and medians in interval and circular-arc graphs ⋮ A linear algorithm for the pos/neg-weighted 1-median problem on a cactus ⋮ Median problem in some plane triangulations and quadrangulations. ⋮ Maintaining centdians in a fully dynamic forest with top trees ⋮ Placing resources in a tree: Dynamic and static algorithms ⋮ 2-medians in trees with pos/neg weights

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A data structure for dynamic trees
• Fully dynamic planarity testing with applications
• On the Complexity of Some Common Geometric Location Problems
• On the Complexity of Maintaining Partial Sums
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Separator based sparsification for dynamic planar graph algorithms

This page was built for publication: Dynamic and static algorithms for optimal placement of resources in a tree