Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1999: Algorithms and Computation pp 195–204Cite as

Carrying Umbrellas: An Online Relocation Problem on Graphs

  • Conference paper
  • First Online:

  • 642 Accesses

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

Abstract

We introduce an online relocation problem on a graph, in which a player who walks around the nodes makes decisions on whether to relocate mobile resources, while not knowing the future requests. We call it Carrying Umbrellas. This paper gives a necessary and sufficient condition under which a competitive algorithm exists and describes an optimal algorithm and anaylzes its competitve ratio. We also extend this problem to the case of digraphs.

Supported in part by KOSEF grant 98-0102-07-01-3.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon, R. M. Karp, D. Peleg, and D. West. A graph-theoretic game and its application to the k-server problem. SIAM J. of Comput., 24(1):78–100, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  2. R. Beigel and W.I Gasarch. The mapmaker’s dilemma. Discrete Applied Mathematics, 34(1):37–48, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. Ben-David, A. Borodin, R.M. Karp, G. Tardos, and A. Widgerson. On the power of randomization in online algorithms. In Proc. of 22nd STOC, pages 379–386, 1990.

    Google Scholar 

  4. Hans L. Bodlaender. On the complexity of some coloring games. Int. J. of Foundation of Computer Science, 2:133–147, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.

    Google Scholar 

  6. M. Chrobak and L. Larmore. The searver problem and online game. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 7, pages 11–64. AMS-ACM, 1992.

    MathSciNet  Google Scholar 

  7. P. Raghavan and M. Snir. Memory versus randomization in online algorithms. In Proc. of 16th ICALP, pages 687–703, 1987.

    Google Scholar 

  8. D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of ACM, 2(28):202–208, 1985.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, KAIST, Korea

    Jae-Ha Lee, Chong-Dae Park & Kyung-Yong Chwa

Authors
  1. Jae-Ha Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chong-Dae Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kyung-Yong Chwa
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, JH., Park, CD., Chwa, KY. (1999). Carrying Umbrellas: An Online Relocation Problem on Graphs. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-46632-0_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66916-6

  • Online ISBN: 978-3-540-46632-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation