Approximation algorithms for time-dependent orienteering
Research output: Contribution to journal › Article
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 ε greater than or equal 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.
|Research areas and keywords||
Subject classification (UKÄ) – MANDATORY
|Journal||Information Processing Letters|
|State||Published - 2002|
No data available