Pages that link to "Item:Q2327672"
From MaRDI portal
The following pages link to Approximate solutions for expanding search games on general networks (Q2327672):
Displaying 13 items.
- A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Competitive search in a network (Q2184175) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Network search games, with arbitrary searcher starting point (Q3184600) (← links)
- The search value of a network (Q3703570) (← links)
- (Q4731030) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm (Q5301126) (← links)