Carrying Umbrellas: An Online Relocation Problem on Graphs
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.
Unable to display preview. Download preview PDF.
- 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
- 5.A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.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