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
Approximation algorithms for the TSP with sharpened triangle inequality
Information Processing Letters
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
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Acquisition of high-resolution images through on-line saccade sequence planning
Proceedings of the third ACM international workshop on Video surveillance & sensor networks
Towards on-line saccade planning for high-resolution image sensing
Pattern Recognition Letters
Towards on-line saccade planning for high-resolution image sensing
Pattern Recognition Letters - Special issue on vision for crime detection and prevention
Particle swarm optimization-based algorithms for TSP and generalized TSP
Information Processing Letters
ROSE: assisting pedestrians to find preferred events and comfortable public transport connections
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
Personalized tourist route generation
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
Time-dependent personal tour planning and scheduling in metropolises
Expert Systems with Applications: An International Journal
Hybrid approach for the public transportation time dependent orienteering problem with time windows
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Integrating public transportation in personalised electronic tourist guides
Computers and Operations Research
| Hi-index | 0.89 |
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 ɛ 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.