6 citations · 8 across the 18 of their papers we have counts for
Showing 2016 · math.OCShow all
3 papers · 2 filters
math.OC2016
Constant Factor Approximate Solutions for Expanding Search on General Networks
Steve Alpern, Thomas Lidbetter
We study the classical problem introduced by R. Isaacs and S. Gal of minimizing the time to find a hidden point on a network moving from a known starting point. Rather than…
math.OC2016
On Submodular Search and Machine Scheduling
Robbert Fokkink, Thomas Lidbetter, László A. Végh
Suppose some objects are hidden in a finite set of hiding places which must be examined one-by-one. The cost of searching subsets of is given by a submodular function and t…
math.OC2016
The expanding search ratio of a graph
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
We study the problem of searching for a hidden target in an environment that is modeled by an edge-weighted graph. A sequence of edges is chosen starting from a given root vertex s…