ALCOMFT-TR-02-13

Fedor V. Fomin and Andrzej Lingas
Approximation algorithms for time-dependent orienteering
Paderborn. Work package 4. May 2002.

Abstract: The time-dependent orienteering problem is dual to the time-dependent traveling salesman problem. It consists of visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time.

For any epsilon >0, we provide a (2+epsilon)-approximation algorithm for the time-dependent orienteering problem which runs in polynomial time if the ratio between the maximum and minimum traveling time between any two sites is constant. No prior upper approximation bounds were known for this time-dependent problem.

Postscript file: ALCOMFT-TR-02-13.ps.gz (159 kb).