On Submodular Search and Machine Scheduling

Robbert Fokkink, Thomas Lidbetter, László A. Végh

Abstract: Suppose that some objects are hidden in a finite set S of hiding places that must be examined one by one. The cost of searching subsets of S is given by a submodular function, and the probability t...