Pages that link to "Item:Q2424806"
From MaRDI portal
The following pages link to On the randomized online strategies for the \(k\)-Canadian traveler problem (Q2424806):
Displaying 15 items.
- Complexity of Canadian traveler problem variants (Q386993) (← 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)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← 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)
- Approximating the Canadian traveller problem with online randomization (Q2663716) (← links)
- An online optimization approach for post-disaster relief distribution with online blocked edges (Q2669638) (← links)
- The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem (Q2680863) (← links)
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem (Q2806869) (← links)
- Canadian traveller problem with predictions (Q6176553) (← links)
