Abstract
The time-dependent orienteering problem is dual to the time dependent traveling salesman problem. It consists in visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time. 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.
Cite
CITATION STYLE
Fomin, F. V., & Lingas, A. (2001). Approximation algorithms for time-dependent orienteering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2138, pp. 508–515). Springer Verlag. https://doi.org/10.1007/3-540-44669-9_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
