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

Theoretical Computer Science

Volumn 165, Issue 2, 1996, Pages 441-461

  Auletta, Vincenzo ^a   Parente, Domenico ^a   Persiano, Giuseppe ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING;

OPTIMAL PLACEMENT; RESOURCES PLACEMENT COST;

TREES (MATHEMATICS);

EID: 0030258099     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00089-8     Document Type: Article

References (14)

1. D. Eppstein, Z. Galil, G.F. Italiano and A. Nissezweig, Sparsification - a technique for speeding up dynamic graph algorithms, in: Proc. 33rd IEEE Symp. on Foundations of Computer Science (1992) 60-69.
2. D. Eppstein, Z. Galil, G.F. Italiano and T.H. Spencer, Separator based sparsification for dynamic planar graph algorithms, in: Proc 25th Annual ACM Symp. on Theory of Computing (1993).
3. G.N. Frederickson, Parametric search and locating supply center in trees, in: Proc. 2nd Workshop on Algorithms and Data Structures, Vol. 519 of Lecture Notes in Computer Science (Springer, Berlin) 299-319.
4. G.N. Frederickson, Data structures for on-line updating of minimum spanning trees, SIAM J. Comput. 14 (1985) 781-798.
5. G.N. Frederickson, Ambivalent data structure for dynamic 2-edge-connectivity and k smallest spanning trees, in: Proc. 32nd IEEE Symp. on Foundations of Computer Science (1991) 632-641.
6. Z. Galil and G.F. Italiano, Maintaining reconnected components of dynamic planar graphs, in: Proc. 18th Internat. Colloquium on Automata, Languages and Programming (ICALP 91), Lecture Notes in Computer Science, Vol. 510 (Springer, Berlin, 1991) 339-350.
7. Z. Galil, G.F. Italiano and N. Sarnak, Fully dynamic planarity testing, in: Proc 24th Ann. ACM Symp. on Theory of Computing (1992).
8. H. Hampapuram and M.L. Fredman, Optimal bi-weighted binary trees and the complexity of maintaining partial sums, in: Proc. 34th IEEE Symp. on Foundations of Computer Science (1993) 480-485.
9. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems, Part II: p-medians, SIAM J. Appl. Math. 37 (1979) 539-560.
10. Jyh-Han Lin and J.S. Vitter, ε-Approximations with minimum packing constraint violation, in: Proc 24th Ann. ACM Symp. on Theory of Computing (1992) 771-782.
11. N. Megiddo and K. Supowit, On the complexity of some common geometric location problems, SIAM J. Comput. 13 (1984) 182-196.
12. C. Papadimitriou, Worst-case and probabilistic analysis of a geometric location problem, SIAM J. Comput. 10 (1981) 542-557.
13. D.D. Sleator and R.E. Tarjan, A data structure for dynamic trees, J. Compu. Syst. Sci. 26 (1993) 362-391
14. A.C. Yao, On the complexity of maintaining partial sums, SIAM J. Comput. 14 (1985) 277-288.