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 $H$ on a network $Q$ moving from a known starting point. Rather than…