The following pages link to (Q4818841):
Displayed 30 items.
- Polynomial time algorithms for some minimum latency problems (Q294831) (← links)
- The \(k\)-server problem (Q458484) (← links)
- Query strategies for priced information (Q696973) (← links)
- On the approximation of shortest escape paths (Q827333) (← links)
- Exact algorithms for the minimum latency problem (Q834971) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- A general framework for searching on a line (Q1676358) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Searching for multiple objects in multiple locations (Q1999403) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Graph exploration by energy-sharing mobile agents (Q2117723) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← links)
- Competitive search in a network (Q2184175) (← links)
- Treasure evacuation with one robot on a disk (Q2220826) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- Searching on a line: a complete characterization of the optimal solution (Q2513671) (← links)
- Complexity of decision-theoretic troubleshooting (Q4416292) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- (Q5090453) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Lower bounds in on-line geometric searching (Q5931368) (← links)
- The ultimate strategy to search on \(m\) rays? (Q5941439) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)
- Online search with a hint (Q6186319) (← links)