6 citations · 8 across the 18 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.OC2015
On the Approximation Ratio of the Random Chinese Postman Tour for Network Search
Thomas Lidbetter
We consider a classic search problem first proposed by S. Gal in which a Searcher randomizes between unit speed paths on a network, aiming to find a hidden point in minimal expecte…
math.OC2015
The solution to an open problem for a caching game
Endre Csóka, Thomas Lidbetter
In a caching game introduced by Alpern et al., a Hider who can dig to a total fixed depth normalized to buries a fixed number of objects among discrete locations. A Searche…