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 ε ≥ 0, we provide a (2+ ε)-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. © 2001 Elsevier Science B.V. All rights reserved.
https://doi.org/10.1016/S0020-0190(01)00313-1Cite as:
@article{Fomin_2002,
doi = {10.1016/s0020-0190(01)00313-1},
url = {https://doi.org/10.1016%2Fs0020-0190%2801%2900313-1},
year = 2002,
month = {jul},
publisher = {Elsevier {BV}},
volume = {83},
number = {2},
pages = {57--62},
author = {Fedor V. Fomin and Andrzej Lingas},
title = {Approximation algorithms for time-dependent orienteering},
journal = {Information Processing Letters}
}