Carrying Umbrellas: An Online Relocation Problem on Graphs

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 compet...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Lee, Jae-Ha, Park, Chong-Dae, Chwa, Kyung-Yong
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Information retrieval. Graph
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0302-9743
1611-3349
DOI:10.1007/3-540-46632-0_21