The following pages link to (Q3796804):
Displaying 19 items.
- The \(k\)-server problem (Q458484) (← links)
- Shortest paths without a map (Q809612) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- On-line scheduling of jobs with fixed start and end times (Q1331962) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- The CNN problem and other \(k\)-server variants (Q1887095) (← links)
- Parallel searching in the plane (Q1903637) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Evacuating equilateral triangles and squares in the face-to-face model (Q2206722) (← links)
- Online searching with turn cost (Q2503358) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- Evacuating an Equilateral Triangle in the Face-to-Face Model (Q3300807) (← links)
- Constructing competitive tours from local information (Q4630252) (← links)
- Exploration of High-Dimensional Grids by Finite Automata (Q5092342) (← links)
- A competitive analysis of nearest neighbor based algorithms for searching unknown scenes (Q5096778) (← links)
- Improved Lower Bounds for Shoreline Search (Q5100947) (← links)
- Collaboration Without Communication: Evacuating Two Robots from a Disk (Q5283360) (← links)
- Exploration of High-Dimensional Grids by Finite State Machines (Q6492093) (← links)
