Dynamic and static algorithms for optimal placement of resources in a tree
From MaRDI portal
(Redirected from Publication:671529)
Recommendations
Cites work
- scientific article; zbMATH DE number 176746 (Why is no real title available?)
- scientific article; zbMATH DE number 177557 (Why is no real title available?)
- scientific article; zbMATH DE number 1256641 (Why is no real title available?)
- A data structure for dynamic trees
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Fully dynamic planarity testing with applications
- On the Complexity of Maintaining Partial Sums
- On the Complexity of Some Common Geometric Location Problems
- Separator based sparsification for dynamic planar graph algorithms
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
Cited in
(13)- Constant-competitive tree node assignment
- Efficient algorithms for centers and medians in interval and circular-arc graphs
- A dynamic programming algorithm for the generalized minimum filter placement problem on tree structures
- Median problem in some plane triangulations and quadrangulations.
- 2-medians in trees with pos/neg weights
- Resource allocation in rooted trees for VLSI applications
- 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
- Placing resources in a tree: dynamic and static algorithms
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)
