An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths

Marco Bender () and Stephan Westphal ()
Additional contact information
Marco Bender: University of Göttingen
Stephan Westphal: University of Göttingen

Journal of Combinatorial Optimization, 2015, vol. 30, issue 1, No 7, 87-96

Abstract: Abstract We consider the $$k$$ k -Canadian Traveller Problem, which asks for a shortest path between two nodes $$s$$ s and $$t$$ t in an undirected graph, where up to $$k$$ k edges may be blocked. An online algorithm learns about a blocked edge when reaching one of its endpoints. Recently, it has been shown that no randomized online algorithm can be better than $$(k+1)$$ ( k + 1 ) -competitive, even if all $$s$$ s - $$t$$ t -paths are node-disjoint. We show that the bound is tight by constructing a randomized online algorithm for this case that achieves the ratio against an oblivious adversary and is therefore best possible.

Keywords: Competitive analysis; Online algorithm; Canadian Traveller Problem (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9634-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:30:y:2015:i:1:d:10.1007_s10878-013-9634-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9634-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().