Improved Approximation Algorithm for the Edge Orienteering Problem

Given a budget and an undirected graph with a cost and a profit function on the edges, the Edge Orienteering Problem asks for a closed walk in the graph that collects the most profit while the sum of costs does not exceed the budget. While the profit is collected only once per edge, the cost is incurred each time the edge is traversed by the walk. In this paper, we present a (4+ε)-approximation algorithm for the Edge Orienteering Problem.