Pages that link to "Item:Q5931368"
From MaRDI portal
The following pages link to Lower bounds in on-line geometric searching (Q5931368):
Displaying 15 items.
- Searching for an axis-parallel shoreline (Q443717) (← links)
- On-line parallel heuristics, processor scheduling and robot searching under the competitive framework (Q1884992) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Interruptible algorithms for multiproblem solving (Q2197326) (← links)
- Optimal scheduling of contract algorithms with soft deadlines (Q2400436) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- Study on the existence of the transportation particle tracking model in the interactive medium (Q5068279) (← links)
- (Q5090453) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
- Online search with a hint (Q6186319) (← links)
- On Reducing the Collision Time Between a Nanosensor and a Randomly Moving Particle in the Fluid (Q6577777) (← links)
