Pages that link to "Item:Q2392736"
From MaRDI portal
The following pages link to The \(k\)-Canadian travelers problem with communication (Q2392736):
Displaying 13 items.
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis (Q887851) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- Online covering salesman problem (Q1743496) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- Multiple canadians on the road: minimizing the distance competitive ratio (Q2279750) (← links)
- Optimal shortest path set problem in undirected graphs (Q2343975) (← links)
- Fibonacci helps to evacuate from a convex region in a grid network (Q2410092) (← 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)
- 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)