A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
From MaRDI portal
Recommendations
Cites work
- A new measure for the study of on-line algorithms
- A note on the k-Canadian traveller problem
- A risk-reward framework for the competitive analysis of financial games
- Competitive k-server algorithms
- scientific article; zbMATH DE number 432827 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Online algorithms. The state of the art
- Shortest paths without a map
- The Canadian Traveller Problem and its competitive analysis
Cited in
(7)- The Canadian Traveller Problem and its competitive analysis
- Multiple canadians on the road: minimizing the distance competitive ratio
- Generalized Canadian traveller problems
- An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- The covering Canadian traveller problem
- Canadian traveller problem with predictions
This page was built for publication: A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505679)