The following pages link to (Q3138961):
Displaying 30 items.
- Robust optimization for routing problems on trees (Q301384) (← links)
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- Complexity of Canadian traveler problem variants (Q386993) (← links)
- Discussion of ``Network routing in a dynamic environment'' (Q641087) (← links)
- A note on the \(k\)-Canadian traveller problem (Q963338) (← links)
- Finding the anti-block vital edge of a shortest path between two nodes (Q1016036) (← links)
- The Canadian Traveller Problem and its competitive analysis (Q1037454) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Multiple canadians on the road: minimizing the distance competitive ratio (Q2279750) (← links)
- Optimal shortest path set problem in undirected graphs (Q2343975) (← links)
- Generalized Canadian traveller problems (Q2343992) (← links)
- An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354) (← links)
- The \(k\)-Canadian travelers problem with communication (Q2392736) (← links)
- On the online multi-agent O-D \(k\)-Canadian traveler problem (Q2410097) (← links)
- Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem (Q2424652) (← links)
- On the randomized online strategies for the \(k\)-Canadian traveler problem (Q2424806) (← links)
- The covering Canadian traveller problem (Q2440168) (← links)
- Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
- Complexity of planning for connected agents in a partially known environment (Q2680862) (← links)
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863) (← links)
- The k-Canadian Travelers Problem with Communication (Q3004652) (← links)
- The reset disambiguation policy for navigating stochastic obstacle fields (Q3005837) (← links)
- Constructing competitive tours from local information (Q4630252) (← links)
- A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem (Q5505679) (← links)
- Efficient, optimal stochastic-action selection when limited by an action budget (Q5962147) (← links)
- Canadian traveller problem with predictions (Q6176553) (← links)
