Orienteering (with Time Windows) on Restricted Graph Classes

Kevin Buchin, Mart Hagedoorn, Guangping Li +1

Given a graph with edge costs and vertex profits and given a budget B, the Orienteering Problem asks for a walk of cost at most B of maximum profit. Additionally, each profit may b…