The following pages link to Shortest paths without a map (Q809612):
Displaying 50 items.
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- PH-graphs for analyzing shortest path problems with correlated traveling times (Q337529) (← links)
- Shortest path through random points (Q350693) (← links)
- Worst-case optimal exploration of terrains with obstacles (Q384930) (← links)
- Complexity of Canadian traveler problem variants (Q386993) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Discussion of ``Network routing in a dynamic environment'' (Q641087) (← links)
- Agent search in uniform b-ary trees: Multiple goals and unequal costs (Q671265) (← links)
- On-line path planning in an unknown polygonal environment (Q707338) (← links)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- On the approximation of shortest escape paths (Q827333) (← links)
- An on-line multi-CBR agent dispatching algorithm (Q855211) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Tree exploration with advice (Q958304) (← links)
- A note on the \(k\)-Canadian traveller problem (Q963338) (← links)
- On the two-dimensional cow search problem (Q987818) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- A representation theorem for minmax regret policies (Q1028893) (← links)
- The Canadian Traveller Problem and its competitive analysis (Q1037454) (← links)
- Interactive foundations of computing (Q1127523) (← links)
- Utility-based on-line exploration for repeated navigation in an embedded graph (Q1274283) (← links)
- Competitive algorithms for the weighted server problem (Q1331957) (← links)
- Agent searching in a tree and the optimality of iterative deepening (Q1341670) (← links)
- On-line algorithms for weighted bipartite matching and stable marriages (Q1342235) (← links)
- On the complexity of partially observed Markov decision processes (Q1351500) (← links)
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets (Q1370934) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- The Steiner traveling salesman problem with online advanced edge blockages (Q1651622) (← links)
- Shortest paths with shortest detours. A biobjective routing problem (Q1673931) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- Online covering salesman problem (Q1743496) (← links)
- Online matching on a line (Q1770389) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- Optimal robot localization in trees (Q1854481) (← links)
- The power of a pebble: Exploring and mapping directed graphs (Q1854539) (← links)
- Competitive online routing in geometric graphs (Q1887089) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Optimal obstacle placement with disambiguations (Q1940016) (← links)
- A simple ant colony optimizer for stochastic shortest path problems (Q1945168) (← links)
- The \(m\)-Steiner traveling salesman problem with online edge blockages (Q2045027) (← links)
- Advice complexity of treasure hunt in geometric terrains (Q2051769) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← links)
- Weighted online minimum latency problem with edge uncertainty (Q2239843) (← links)
- Metrical service systems with multiple servers (Q2258084) (← links)
- Multiple canadians on the road: minimizing the distance competitive ratio (Q2279750) (← links)
