Pages that link to "Item:Q1331954"
From MaRDI portal
The following pages link to Constructing competitive tours from local information (Q1331954):
Displayed 20 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- A parametric simplex algorithm for linear vector optimization problems (Q526835) (← links)
- A competitive analysis of algorithms for searching unknown scenes (Q685600) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- Competitive online routing in geometric graphs (Q1887089) (← links)
- Online graph exploration: New results on old and new algorithms (Q1929219) (← links)
- Online graph exploration on a restricted graph class: optimal solutions for tadpole graphs (Q2196574) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Online searching with an autonomous robot (Q2489019) (← links)
- Online graph exploration on trees, unicyclic graphs and cactus graphs (Q2656355) (← links)
- Online Graph Exploration: New Results on Old and New Algorithms (Q3012942) (← links)
- Online traveling salesman problems with service flexibility (Q3100693) (← links)
- Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics (Q3132937) (← links)
- Treasure Hunt with Advice (Q3460725) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Constructing competitive tours from local information (Q4630252) (← links)
- ONLINE ROUTING IN CONVEX SUBDIVISIONS (Q4818562) (← links)
- The Power of Recourse for Online MST and TSP (Q5890825) (← links)