Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1995: Automata, Languages and Programming pp 232–243Cite as

Placing resources in a tree: Dynamic and static algorithms

  • Algorithms II
  • Conference paper
  • First Online:

  • 150 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 944))

Abstract

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.

Partially supported by Progetto MURST 40%, Algoritmi, Modelli di Calcolo e Strutture Informative.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Auletta, D. Parente, G. Persiano, Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree, submitted for publication. Available on the WWW at www.unisa.it.

    Google Scholar 

  2. H. Hampapuram, Fredman M.L., Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums, in Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 480–485.

    Google Scholar 

  3. O. Kariv and S.L. Hakimi, An Algorithmic Approach to Network Location Problems, Part II: p-medians, SIAM Journal on Applied Math., 37 (1979), pp.539–560.

    Google Scholar 

  4. C. Papadimitriou, Worst-Case and Probabilistic Analysis of a Geometric Location Problem, SIAM Journal on Computing, 10 (1981), pp. 542–557.

    Google Scholar 

  5. D.D. Sleator, R.E. Tarjan, A data structure for dynamic trees, in J. Compu. Syst. Sci., 24:362–381, 1983.

    Google Scholar 

  6. A. C. Yao, On the complexity of Maintaining Partial Sums, SIAM Journal on Computing, 14 (1985), pp. 277–288.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica ed Appl., Università di Salerno, 84081, Baronissi, Italy

    Vincenzo Auletta, Domenico Parente & Giuseppe Persiano

Authors
  1. Vincenzo Auletta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Domenico Parente
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Giuseppe Persiano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Auletta, V., Parente, D., Persiano, G. (1995). Placing resources in a tree: Dynamic and static algorithms. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation