Pages that link to "Item:Q3083275"
From MaRDI portal
The following pages link to Search Games on Trees with Asymmetric Travel Times (Q3083275):
Displayed 15 items.
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Approximate solutions for expanding search games on general networks (Q2327672) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Search games on a network with travelling and search costs (Q2349413) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807) (← links)
- Control Sequencing in a Game of Identity Pursuit-Evasion (Q5501220) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)