Initial point search on weighted trees
From MaRDI portal
Publication:4314865
Recommendations
Cited in
(10)- Static search games played over graphs and general metric spaces
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
- A proof of the Kikuta-Ruckle conjecture on cyclic caching of resources
- Weighted search games
- A new approach to Gal's theory of search games on weakly Eulerian networks
- Accumulation games. I: Noisy search
- Search games on trees with asymmetric travel times
- Search games on a network with travelling and search costs
- Screening and hiding versus search
- Optimal trade-off between speed and acuity when searching for a small object
This page was built for publication: Initial point search on weighted trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4314865)