Pages that link to "Item:Q2513671"
From MaRDI portal
The following pages link to Searching on a line: a complete characterization of the optimal solution (Q2513671):
Displaying 15 items.
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Linear search by a pair of distinct-speed robots (Q1755792) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Competitive search in a network (Q2184175) (← links)
- Linear Search by a Pair of Distinct-Speed Robots (Q2835026) (← links)
- (Q5090453) (← links)
- Competitive Searching for a Line on a Line Arrangement. (Q5091041) (← links)
- Energy Consumption of Group Search on a Line (Q5092340) (← links)
- Wireless evacuation on \(m\) rays with \(k\) searchers (Q5919422) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Weighted online search (Q6133641) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)
- Online search with a hint (Q6186319) (← links)
