Dynamic and static algorithms for optimal placement of resources in a tree
Authors:
- Vincenzo AulettaVAVincenzo Auletta
- Domenico ParenteDPDomenico Parente
- Giuseppe PersianoGPGiuseppe Persiano
- 10 October 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 165 (2) , 441-461
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- On the Complexity of Maintaining Partial SumsSIAM Journal on Computing, 1985
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- Worst-Case and Probabilistic Analysis of a Geometric Location ProblemSIAM Journal on Computing, 1981
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979