Pages that link to "Item:Q3184600"

The following pages link to Network search games, with arbitrary searcher starting point (Q3184600):

Displaying 22 items.

• A foraging problem: sit-and-wait versus active predation (Q621674) (← links)
• A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
• Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
• On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
• Continuous patrolling and hiding games (Q1735165) (← links)
• The expanding search ratio of a graph (Q1741496) (← links)
• Patrolling a perimeter (Q1926970) (← links)
• Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
• A competitive search game with a moving target (Q2158054) (← 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)
• 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: A Review (Q2961390) (← links)
• Search Games for an Immobile Hider (Q2961391) (← links)
• Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
• Hide-and-seek games on a tree to which Eulerian networks are attached (Q3184601) (← links)
• Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
• Integer programming models and algorithms for the graph decontamination problem with mobile agents (Q5326775) (← links)
• Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807) (← links)