Placing Resources in a Tree: Dynamic and Static Algorithms

We study the classical problem of optimally placing resources in a tree. We give dynamic algorithms that recompute the optimal solution after a weight change in polylogarithmic time for the case of one resource in a general tree and for any constant number of resources in a complete tree. Our algorithms are the first dynamic algorithms for this problem. We also give linear-time algorithms for the static version of the problem for two resources. Previously known algorithms run in time quadratic in the number of vertices. We also discuss an on-line amortized constant time algorithm for placing any number of resources on a line.

[1]  Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada , 1992, STOC.

[2]  David Eppstein,et al.  Separator based sparsification for dynamic planar graph algorithms , 1993, STOC '93.

[3]  David Eppstein,et al.  Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.

[4]  Greg N. Frederickson.  Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees , 1997, SIAM J. Comput..

[5]  J. Vitter,et al.  Approximations with Minimum Packing Constraint Violation , 1992 .

[6]  Mimmo Parente,et al.  Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree , 1996, Theor. Comput. Sci..

[7]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[8]  Zvi Galil,et al.  Maintaining Biconnected Components of Dynamic Planar Graphs , 1991, ICALP.

[9]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[10]  Christos H. Papadimitriou,et al.  Worst-Case and Probabilistic Analysis of a Geometric Location Problem , 1981, SIAM J. Comput..

[11]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[12]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[13]  Andrew Chi-Chih Yao.  On the Complexity of Maintaining Partial Sums , 1985, SIAM J. Comput..

[14]  Michael L. Fredman,et al.  Optimal bi-weighted binary trees and the complexity of maintaining partial sums , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[15]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[16]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.