Pages that link to "Item:Q1414372"

The following pages link to On the optimality of a simple strategy for searching graphs (Q1414372):

Displaying 31 items.

• A new approach to Gal's theory of search games on weakly Eulerian networks (Q692087) (← links)
• Scheduling search procedures: The wheel of fortune (Q880568) (← links)
• Search for an immobile entity on a network (Q933506) (← links)
• Network search games with immobile hider, without a designated searcher starting point (Q933761) (← links)
• Ranking hypotheses to minimize the search cost in probabilistic inference models (Q1025988) (← links)
• The summation and bottleneck minimization for single-step searching on weighted graphs (Q1310944) (← links)
• Complexity of searching an immobile hider in a graph (Q1377669) (← 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)
• Linear search by a pair of distinct-speed robots (Q1755792) (← links)
• Searching for an evader in an unknown graph by an optimal number of searchers (Q2007918) (← 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)
• On the typical case complexity of graph optimization (Q2581548) (← links)
• On the multicriterial problem of the search for optimal sources in a graph (Q2736212) (← links)
• Patrolling a Border (Q2957456) (← links)
• Search Games: A Review (Q2961390) (← links)
• Search Games for an Immobile Hider (Q2961391) (← links)
• Tools to Manage Search Games on Lattices (Q2961392) (← links)
• Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
• Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
• (Q3570515) (← links)
• The complexity of searching a graph (Q3777477) (← links)
• (Q4028101) (← links)
• Optimal parametric search on graphs of bounded tree-width (Q5056174) (← links)
• Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← 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)
• Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs (Q6075758) (← links)