A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for tsp with neighborhoods in the plane. In SODA '01, pages 38--46, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Balanced Partition of Minimum Spanning Trees.. - Andersson.. (Correct)
....tour of shortest length that visits all of the buyers neighborhoods and finally returns to his initial departure point. Both these problems are related to the problem known in the literature as the Traveling Salesperson problem with Neighborhoods (TSPN) and which has been extensively studied [2, 4, 6, 7, 8, 9]. The problem (TSPN) asks for the shortest tour that visits each of the neighborhoods. The problem was recently shown to be APX hard[7] Interesting generalizations of the TSPN problem arise when additional resources (k 1 robots in the sheet cutting problem, or k 1 salespersons in the second ....
A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for tsp with neighborhoods in the plane. Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001.
Building Bridges Between Convex Regions - Ahn, Cheong, Shin (2001) (Correct)
....relative to the salesman s. The salesman wants to find a set p, p) of market places and a tour visiting them that minimizes this cost. The usual Euclidean TSP is the special case where each region is a single point, and so the TSBP is NP hard. The Euclidean TSP with neighborhoods (TSPN) [1, 6, 3] is the special case where 0: the cost of a tour is simply the length of the tour itself, regardless of the maximum travel distances. The TSPN in the plane has been studied recently by Dumitrescu and Mitchell [3] who presented a PTAS for the case of disjoint unit disk neighborhoods, and a ....
....and so the TSBP is NP hard. The Euclidean TSP with neighborhoods (TSPN) 1, 6, 3] is the special case where 0: the cost of a tour is simply the length of the tour itself, regardless of the maximum travel distances. The TSPN in the plane has been studied recently by Dumitrescu and Mitchell [3], who presented a PTAS for the case of disjoint unit disk neighborhoods, and a constant factor approximation algorithm for arbitrary (possibly overlapping) connected (not necessarily convex) regions with the same diameter. No approximation results appear to be known in more than two dimensions, ....
A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for tsp with neighborhoods in the plane. In Proc. 12th Syrup. on Discrete Algorithms, 2001.
Building Bridges Between Convex Regions - Ahn, Cheong, Shin (Correct)
....to the salesman s. The salesman wants to nd a set fp 1 ; pk g of market places and a tour visiting them that minimizes this cost. The usual Euclidean TSP is the special case where each region is a single point, and so the TSBP is NP hard. The Euclidean TSP with neighborhoods (TSPN) [1, 6, 3] is the special case where = 0: the cost of a tour is simply the length of the tour itself, regardless of the maximum travel distances. The TSPN in the plane has been studied recently by Dumitrescu and Mitchell [3] who presented a PTAS for the case of disjoint unit disk neighborhoods, and a ....
....and so the TSBP is NP hard. The Euclidean TSP with neighborhoods (TSPN) 1, 6, 3] is the special case where = 0: the cost of a tour is simply the length of the tour itself, regardless of the maximum travel distances. The TSPN in the plane has been studied recently by Dumitrescu and Mitchell [3], who presented a PTAS for the case of disjoint unit disk neighborhoods, and a constant factor approximation algorithm for arbitrary (possibly overlapping) connected (not necessarily convex) regions with the same diameter. No approximation results appear to be known in more than two dimensions, ....
A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for tsp with neighborhoods in the plane. In Proc. 12th Symp. on Discrete Algorithms, 2001.
Stochastic Event Capture Using Mobile Sensors Subject to.. - Bisnik, Abouzeid, Isler (2006) (Correct)
No context found.
A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for tsp with neighborhoods in the plane. In SODA '01, pages 38--46, 2001.
Defining Lines of Maximum Probability for the Design of Patrol.. - Bacao, Lobo (2005) (Correct)
No context found.
Dumitrescu, A. and J. S. B. Mitchell, 2003, "Approximation algorithms for TSP with neighborhoods in the plane." Journal of Algorithms (Elsevier) 48(1), p 135-159.
On the Complexity of Approximating TSP with Neighborhoods and .. - Safra, Schwartz (Correct)
No context found.
A. Dumitrescu and J. S. B. Mitchell. Approximation algorithms for TSP with neighborhoods in the plane. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), pages 38--46, New York, January 7--9 2001. ACM Press.
Shortest Paths with Single-Point Visibility Constraints - Khosravi, Ghodsi (Correct)
No context found.
Adrian Dumitrescu and Joseph S. B. Mitchell. Approximation algorithms for TSP with neighborhoods in the plane. In Symposium on Discrete Algorithms (2001) 38--46.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC