Back to Search
Start Over
THE EUCLIDEAN ORIENTEERING PROBLEM REVISITED.
- Source :
- SIAM Journal on Computing; 2008, Vol. 38 Issue 1, p385-397, 13p, 6 Diagrams
- Publication Year :
- 2008
-
Abstract
- We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r ∊ P, and a length constraint B, one needs to find a path starting from r that visits as many points of P as possible and of length not exceeding B. We present a (1 - ϵ)-approximation algorithm for this problem that runs in n<superscript>O(1/ϵ)</superscript> time; the computed path visits at least (1 - ϵ)k<subscript>opt</subscript> points of P, where k<subscript>opt</subscript> is the number of points visited by an optimal solution. This is the first polynomial time approximation scheme for this problem. The algorithm also works in higher dimensions. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00975397
- Volume :
- 38
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- SIAM Journal on Computing
- Publication Type :
- Academic Journal
- Accession number :
- 32897076
- Full Text :
- https://doi.org/10.1137/060667839