Pages that link to "Item:Q4630252"
From MaRDI portal
The following pages link to Constructing competitive tours from local information (Q4630252):
Displaying 7 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- Competitive on-line coverage of grid environments by a mobile robot (Q1869751) (← links)
- Exploring sparse graphs with advice (Q2105435) (← links)
- Serving requests with on-line routing (Q5056164) (← links)
- Competitive algorithms for the on-line traveling salesman (Q5057434) (← links)