Pages that link to "Item:Q3631895"
From MaRDI portal
The following pages link to Competitive Online Approximation of the Optimal Search Ratio (Q3631895):
Displaying 15 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- An improved online evacuation strategy from a convex region on grid networks (Q724733) (← links)
- On the approximation of shortest escape paths (Q827333) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Reaching a target in the plane with no information (Q1799599) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← links)
- Competitive search in a network (Q2184175) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Fibonacci helps to evacuate from a convex region in a grid network (Q2410092) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
- Online search with a hint (Q6186319) (← links)
