The traveling salesman problem for lines and rays in the plane

Details The traveling salesman problem for lines and rays in the plane The traveling salesman problem for lines and rays in the plane

2012-04-26

arxiv.org/abs/1204.5828v1

Computer Science

Computational Geometry

10 pages, 5 figures

Scientific paper

In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of $n$ regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we seek a shortest path that visits each region. We present several linear-time approximation algorithms with improved ratios for these problems for two cases of neighborhoods that are (infinite) lines, and respectively, (half-infinite) rays. Along the way we derive a tight bound on the minimum perimeter of a rectangle enclosing an open curve of length $L$.

Affiliated with

Also associated with

No associations

Rating

The traveling salesman problem for lines and rays in the plane does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The traveling salesman problem for lines and rays in the plane, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The traveling salesman problem for lines and rays in the plane will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-313641