On the randomized online strategies for the k-Canadian traveler problem

Davood Shiri () and F. Sibel Salman ()
Additional contact information
Davood Shiri: Koc University
F. Sibel Salman: Koc University

Journal of Combinatorial Optimization, 2019, vol. 38, issue 1, No 14, 254-267

Abstract: Abstract We consider the online k-Canadian Traveler Problem (k-CTP) which is defined on an undirected graph with a given source node O and a destination node D. Non-negative edge costs are given. The traveling agent is initially at O. There are k blocked edges in the graph, but these edges are not known to the agent. A blocked edge is learned when the agent arrives at one of its end-nodes. The goal of the agent is to arrive at D with minimum total cost. We consider the k-CTP on graphs that consist of only node-disjoint O–D paths, where it was shown that there is no randomized online strategy with competitive ratio better than $$k+1$$ k + 1 . An optimal randomized online strategy was also given. However, we prove that the given strategy cannot be implemented in some cases. We also modify the given strategy such that it can be implemented in all cases and meets the lower bound of $$k+1$$ k + 1 .

Keywords: k-CTP; Competitive ratio; Online strategies; Randomized strategies (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00378-1 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:38:y:2019:i:1:d:10.1007_s10878-019-00378-1

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

DOI: 10.1007/s10878-019-00378-1

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 ().