The following pages link to On the linear search problem (Q2530990):
Displaying 50 items.
- Online algorithms for searching and exploration in the plane (Q465662) (← links)
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- Multiplicative linear search for a Brownian target motion (Q646171) (← links)
- Bike assisted evacuation on a line (Q831791) (← links)
- The beachcombers' problem: walking and searching with mobile robots (Q896140) (← links)
- Optimal multiplicative generalized linear search plan for a discrete random walker (Q896731) (← links)
- Optimal search paths for random variables (Q1053598) (← links)
- The linear search problem rides again (Q1084757) (← links)
- Star search -- a different show (Q1261911) (← links)
- Coordinated search for an object hidden on the line (Q1278437) (← links)
- Rendezvous search on the line with bounded resources: Expected time minimization (Q1278996) (← links)
- Evacuating two robots from multiple unknown exits in a circle (Q1686109) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- A generalization of Lévy's concentration-variance inequality (Q1824270) (← links)
- Generalizations in the linear search problem (Q1895083) (← links)
- Dynamic programming and the backpacker's linear search problem (Q1903645) (← links)
- Lower bounds for searching robots, some faulty (Q1981629) (← links)
- Minimizing the average searching time for an object within a graph (Q2007833) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Two-agent tree evacuation (Q2117727) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Evacuating equilateral triangles and squares in the face-to-face model (Q2206722) (← links)
- Priority evacuation from a disk: the case of \(n \geq 4\) (Q2210503) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Son of the linear search problem (Q2266666) (← links)
- Beachcombing on strips and islands (Q2285133) (← links)
- Searching for a non-adversarial, uncooperative agent on a cycle (Q2285151) (← links)
- Priority evacuation from a disk: the case of \(n = 1,2,3\) (Q2285157) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Online searching with turn cost (Q2503358) (← links)
- More on the linear search problem (Q2530991) (← links)
- Yet more on the linear search problem (Q2543566) (← links)
- The return of the linear search problem (Q2560025) (← links)
- Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Evacuating Robots from a Disk Using Face-to-Face Communication (Extended Abstract) (Q2947016) (← links)
- Search Games: A Review (Q2961390) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Better Upper Bounds for Searching on a Line with Byzantine Robots (Q3297827) (← links)
- Evacuating an Equilateral Triangle in the Face-to-Face Model (Q3300807) (← links)
- God save the queen (Q3305734) (← links)
- On the minimality of search paths under absolutely continuous univariate distributions (Q4735029) (← links)
- Lower bounds in on-line geometric searching metric searching (Q5055955) (← links)
- Querying with Uncertainty (Q5056054) (← links)
