Generalized Canadian traveller problems
From MaRDI portal
Publication:2343992
DOI10.1007/S10878-013-9614-ZzbMATH Open1320.90070OpenAlexW2088810319MaRDI QIDQ2343992FDOQ2343992
Authors: Chung-Shou Liao, Yamming Huang 
Publication date: 11 May 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9614-z
Recommendations
Cites Work
- A note on two problems in connexion with graphs
- Title not available (Why is that?)
- Shortest paths without a map
- A new measure for the study of on-line algorithms
- Title not available (Why is that?)
- A note on the \(k\)-Canadian traveller problem
- The Canadian Traveller Problem and its competitive analysis
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
Cited In (14)
- Canadian traveller problem with predictions
- The Canadian traveller problem revisited
- Repeated-task Canadian traveler problem
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
- Policies for risk-aware sensor data collection by mobile agents
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- On the randomized online strategies for the \(k\)-Canadian traveler problem
- Approximating the Canadian traveller problem with online randomization
- The Canadian Traveller Problem and its competitive analysis
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
- Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem
- Multiple canadians on the road: minimizing the distance competitive ratio
- The covering Canadian traveller problem
- Complexity of Canadian traveler problem variants
This page was built for publication: Generalized Canadian traveller problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2343992)
