Pages that link to "Item:Q2806869"
From MaRDI portal
The following pages link to An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem (Q2806869):
Displaying 5 items.
- Complexity of Canadian traveler problem variants (Q386993) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- Improved deterministic strategy for the Canadian Traveller Problem exploiting small max-\((s,t)\)-cuts (Q2193076) (← 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)