Pages that link to "Item:Q5326807"
From MaRDI portal
The following pages link to Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807):
Displaying 21 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)
- A search problem on a bipartite network (Q1735184) (← links)
- The expanding search ratio of a graph (Q1741496) (← 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)
- Online failure diagnosis in interdependent networks (Q2226505) (← 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 with multiple hidden objects (Q2862458) (← links)
- A search game with unknown examination costs and travel times (Q2875628) (← links)
- Network search games, with arbitrary searcher starting point (Q3184600) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Sequential Location Game on Continuous Directional Star Networks (Q3297829) (← links)
- A Linear Programming Approach to the Search Game on a Network with Mobile Hider (Q4016756) (← links)
- A SEARCH GAME WITH TRAVELING COST (Q4018343) (← links)
- Initial point search on weighted trees (Q4314865) (← links)
- (Q4731030) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- The faulty Satnav (GPS) problem: search for home in networks with unreliable directions (Q6076348) (← links)
