The Canadian traveller problem on outerplanar graphs
From MaRDI portal
Cites work
- A note on the k-Canadian traveller problem
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
- An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
- Approximation algorithms for NP-complete problems on planar graphs
- Canadians should travel randomly
- Complexity of Canadian traveler problem variants
- scientific article; zbMATH DE number 432827 (Why is no real title available?)
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- Multiple canadians on the road: minimizing the distance competitive ratio
- On the online multi-agent O-D \(k\)-Canadian traveler problem
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- Shortest paths without a map
- The Canadian Traveller Problem and its competitive analysis
- The covering Canadian traveller problem
- The covering Canadian traveller problem revisited
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem
- Yet more on the linear search problem
Cited in
(1)
This page was built for publication: The Canadian traveller problem on outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241017)
