J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing, 6(4):469--??, Winter 1999. 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 ....
J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for tsp with neighborhoods. Nordic Journal of Computing, 6:469--488, 1999.
Approximation algorithms for TSP with neighborhoods in the.. - Dumitrescu, Mitchell (2001) (7 citations) (Correct)
....bounded by a constant. For the general case of connected polygonal regions, Mata and Mitchell [11] obtained an O(log n) approximation algorithm, based on guillotine rectangular subdivisions , with time bound O(m 5 ) where m is the total complexity of the n regions. Gudmundson and Levcopoulos [7] have recently obtained a faster method, which, for any xed 0, is guaranteed to perform at least one of the following tasks (although one does not know in advance which one will be accomplished) 1) it outputs a tour of length at most O(log n) times optimum in time O(n log n m) 2) it ....
J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing, 6:469-488, 1999.
Geometric Shortest Paths and Network Optimization - Mitchell (1998) (39 citations) (Correct)
....of the approximation factors obtained for each class individually. For the general case of connected polygonal neighborhoods, Mata and Mitchell [272] obtained an O(logk) approximation algorithm, based on guillotine rectangular subdivisions, with time bound O(n 5 ) Gudmundsson and Levcopoulos [184] have recently obtained a faster method, which, for any fixed ffl 0, is guaranteed to perform at least one of the following two tasks (although one does not know in advance which one will be accomplished) 1) it outputs in time O(n k log k) a tour with length at most O(log k) times optimal; ....
J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods. Technical Report LU-CS-TR:97-195, Dept. of Comp. Sci., Lund University, 1997.
A Fast Approximation Algorithm for TSP with.. - Gudmundsson, Levcopoulos (1997) (6 citations) Self-citation (Gudmundsson Levcopoulos) (Correct)
....how the methods presented in Section 3 4 can be used to obtain approximation algorithms for some separation problems. The algorithms presented in Section 3 4 and 6 are very practical and easy to implement. The TSPN algorithm has been implemented and runs eciently even for quite large instances [8]. The proofs omitted in this extended abstract can be found in [8] 2 De nitions and Preliminaries Throughout this paper we will denote by X the collection of k possibly overlapping simple polygons, called neighborhoods, with totally n vertices in the plane. A polygonal subdivision D of a ....
....approximation algorithms for some separation problems. The algorithms presented in Section 3 4 and 6 are very practical and easy to implement. The TSPN algorithm has been implemented and runs eciently even for quite large instances [8] The proofs omitted in this extended abstract can be found in [8]. 2 De nitions and Preliminaries Throughout this paper we will denote by X the collection of k possibly overlapping simple polygons, called neighborhoods, with totally n vertices in the plane. A polygonal subdivision D of a polygon P is said to be guillotine if it is a binary planar partition ....
[Article contains additional citation context not shown here]
J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods and red-blue separation. Technical Report LU-CS-TR:97-196, Dept. of Computer Science, Lund University, Lund,Sweden, 1997.
A Fast Approximation Algorithm for TSP with.. - Gudmundsson, Levcopoulos (1997) (6 citations) Self-citation (Gudmundsson Levcopoulos) (Correct)
....how the methods presented in Section 3 4 can be used to obtain approximation algorithms for some separation problems. The algorithms presented in Section 3 4 and 6 are very practical and easy to implement. The TSPN algorithm has been implemented and runs e#ciently even for quite large instances [8]. The proofs omitted in this extended abstract can be found in [8] 2 Definitions and Preliminaries Throughout this paper we will denote by X the collection of k possibly overlapping simple polygons, called neighborhoods, with totally n vertices in the plane. A polygonal subdivision D of a ....
....approximation algorithms for some separation problems. The algorithms presented in Section 3 4 and 6 are very practical and easy to implement. The TSPN algorithm has been implemented and runs e#ciently even for quite large instances [8] The proofs omitted in this extended abstract can be found in [8]. 2 Definitions and Preliminaries Throughout this paper we will denote by X the collection of k possibly overlapping simple polygons, called neighborhoods, with totally n vertices in the plane. A polygonal subdivision D of a polygon P is said to be guillotine if it is a binary planar partition ....
[Article contains additional citation context not shown here]
J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods and red-blue separation. Technical Report LU-CS-TR:97-196, Dept. of Computer Science, Lund University, Lund,Sweden, 1997.
On the Complexity of Approximating TSP with Neighborhoods and .. - Safra, Schwartz (Correct)
No context found.
J. Gudmundsson and C. Levcopoulos. A fast approximation algorithm for TSP with neighborhoods. Nordic Journal of Computing, 6(4):469--??, Winter 1999.
Shortest Paths with Single-Point Visibility Constraints - Khosravi, Ghodsi (Correct)
No context found.
Joachim Gudmundsson and Christos Levcopoulos. A fast approximation algorithm for TSP with neighborhoods and red-blue separation. Lecture Notes in Computer Science 1627 (1999) 473--482.
Efficient Algorithms and Data Structures for Geometric.. - group, Science.. (Correct)
No context found.
J. Gudmundsson and C. Levcopoulos. A Fast Approximation Algorithm for TSP with Neighborhoods. Accepted for publication in Nordic Journal of Computing, 1999.
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