Pages that link to "Item:Q2193076"
From MaRDI portal
The following pages link to Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts (Q2193076):
Displaying 3 items.
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- On the online multi-agent O-D \(k\)-Canadian traveler problem (Q2410097) (← links)
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863) (← links)