On the approximation ratio of the random Chinese postman tour for network search
From MaRDI portal
Publication:1694817
DOI10.1016/j.ejor.2017.06.004zbMath1380.91035arXiv1512.07215OpenAlexW2580418165MaRDI QIDQ1694817
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07215
Search theory (90B40) Games involving graphs (91A43) Applications of game theory (91A80) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
Cites Work
- A new approach to Gal's theory of search games on weakly Eulerian networks
- Shortest coverings of graphs with cycles
- Network search games with immobile hider, without a designated searcher starting point
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- Search games and other applications of game theory
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- Patrolling a perimeter
- Search games on a network with travelling and search costs
- Search games with immobile hider
- Patrolling Games
- Find-and-Fetch Search on a Tree
- Network search games, with arbitrary searcher starting point
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
- Search Games with Mobile and Immobile Hider
- Matching, Euler tours and the Chinese postman
- A search game on the union of graphs with immobile hider
- Search Theory
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Search games on networks with travelling and search costs and with arbitrary searcher starting points
- Unnamed Item
- Unnamed Item
