Running Errands in Time: Approximation Algorithms for Stochastic Orienteering

Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi

Abstract: In the stochastic orienteering problem, we are given a finite metric space, where each node contains a job with some deterministic reward and a random processing time. The processing time distribut...