The traveling salesman problem with distances one and two
Mathematics of Operations Research
Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Bicriteria network design problems
Journal of Algorithms
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Web Searching Using Temporal Factors
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Approximation Results for Kinetic Variants of TSP
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An explicit lower bound for TSP with distances one and two
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 0.01 |
The time-dependent orienteering problem is dual to the timedependent 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.