Pages that link to "Item:Q2663716"

The following pages link to Approximating the Canadian traveller problem with online randomization (Q2663716):

Displaying 10 items.

• The Canadian tour operator problem on paths: tight bounds and resource augmentation (Q326483) (← links)
• A note on the \(k\)-Canadian traveller problem (Q963338) (← links)
• Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
• Online routing and searching on graphs with blocked edges (Q2165266) (← links)
• Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts (Q2193076) (← links)
• An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths (Q2352354) (← links)
• On the online multi-agent O-D \(k\)-Canadian traveler problem (Q2410097) (← links)
• On the randomized online strategies for the \(k\)-Canadian traveler problem (Q2424806) (← links)
• The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863) (← links)
• Canadian traveller problem with predictions (Q6176553) (← links)