On the online multi-agent O-D \(k\)-Canadian traveler problem

DOI10.1007/s10878-016-0079-8zbMath1382.90095OpenAlexW2513559281MaRDI QIDQ2410097

Davood Shiri, F. Sibel Salman

Publication date: 17 October 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-016-0079-8

zbMATH Keywords

communicationcompetitive analysisonline strategiesagents' intelligencemulti-agent \(k\)-CTP

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (8)

Approximating the Canadian traveller problem with online randomization ⋮ An online optimization approach for post-disaster relief distribution with online blocked edges ⋮ Complexity of planning for connected agents in a partially known environment ⋮ The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem ⋮ Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem ⋮ On the randomized online strategies for the \(k\)-Canadian traveler problem ⋮ Weighted online minimum latency problem with edge uncertainty ⋮ Multiple canadians on the road: minimizing the distance competitive ratio

Cites Work

• Unnamed Item
• Unnamed Item
• The Steiner traveling salesman problem with online edge blockages
• Shortest paths without a map
• A note on the \(k\)-Canadian traveller problem
• The Canadian Traveller Problem and its competitive analysis
• Generalized Canadian traveller problems
• An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
• The \(k\)-Canadian travelers problem with communication
• The covering Canadian traveller problem
• Finding the k Shortest Paths
• A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
• Finding the K Shortest Loopless Paths in a Network

This page was built for publication: On the online multi-agent O-D \(k\)-Canadian traveler problem