{'fraction_non_alphanumeric': 0.014895057549085985, 'fraction_numerical': 0.0, 'mean_word_length': 5.057377049180328, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering

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 distributions are known and independent across nodes. However the actual processing time of a job is not known until it is completely processed. The objective is to compute a nonanticipatory policy to visit nodes and run the corresponding jobs so as to maximize the total expected reward, subject to the total distance traveled plus the total processing time being at most a given budget of B. This problem combines aspects of the stochastic knapsack problem with uncertain item sizes as well as the deterministic orienteering problem. 
 
In this paper, we consider both nonadaptive and adaptive policies for Stochastic Orienteering. We present a constant-factor approximation algorithm for the nonadaptive version and an Olog log B-approximation algorithm for the adaptive version. We extend both these results to directed metrics and a more general sequence orienteering problem. 
 
Finally, we address the stochastic orienteering problem when the node rewards are also random and possibly correlated with the processing time and obtain an Olog n log B-approximation algorithm; here n is the number of nodes in the metric. All our results for adaptive policies also bound the corresponding “adaptivity gaps”.