Pages that link to "Item:Q1741496"
From MaRDI portal
The following pages link to The expanding search ratio of a graph (Q1741496):
Displaying 13 items.
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- Weighted group search on a line \& implications to the priority evacuation problem (Q2098167) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (extended abstract) (Q2148885) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Competitive search in a network (Q2184175) (← links)
- Evacuating from \(\ell_p\) unit disks in the wireless model (Q2680178) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Weighted online search (Q6133641) (← links)
- Algorithms for \(p\)-Faulty Search on a half-line (Q6174824) (← links)
- Online search with a hint (Q6186319) (← links)
