Dynamic and static algorithms for optimal placement of resources in a tree
From MaRDI portal
Publication:671529
DOI10.1016/0304-3975(96)00089-8zbMATH Open0872.68139OpenAlexW2007921877MaRDI QIDQ671529FDOQ671529
Mimmo Parente, Giuseppe Persiano, V. 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
Recommendations
Cites Work
- A data structure for dynamic trees
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- On the Complexity of Some Common Geometric Location Problems
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Separator based sparsification for dynamic planar graph algorithms
- Title not available (Why is that?)
- On the Complexity of Maintaining Partial Sums
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- Fully dynamic planarity testing with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (11)
- Constant-competitive tree node assignment
- Median problem in some plane triangulations and quadrangulations.
- 2-medians in trees with pos/neg weights
- Placing resources in a tree: Dynamic and static algorithms
- Resource allocation in bounded degree trees
- Optimal placement of identical resources in a tree
- Maintaining centdians in a fully dynamic forest with top trees
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions
- Worst-case optimal tree layout in external memory
- Efficient algorithms for centers and medians in interval and circular-arc graphs
This page was built for publication: Dynamic and static algorithms for optimal placement of resources in a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671529)
