(Enter summary)
Abstract: We solve the special case of the Euclidean Traveling Salesman Problem where n#m cities lie on the boundary of the convex hull of all n cities, and the other m cities lie on a line segment inside this convex hull by an algorithm which needs O(mn) time and O(n) space. (Update)
Context of citations to this paper: More
...parallel but might be slightly perturbated and slightly rotated without destroying polynomial solvability. Deineko, Van Dal and Rote [2] investigated another special case, the convex hull and line TSP: Here n Gamma m cities lie on the Lcf Free Tours for the TSP 3 Q Q Q...
.... ae ae ae ae ae ae X X X X X Gamma Gamma l l l Figure 2: Illustrations to the N line TSP In 1994, Deineko, Van Dal and Rote [37] investigated another related special case, the convexhull and line TSP. Here n Gamma m cities lie on the boundary of the convex hull...
Cited by: More
The N-line Traveling Salesman Problem - Rote (1991)
(Correct)
Well-Solvable Special Cases of the TSP: A Survey - Burkard, Deineko, van Dal.. (1995)
(Correct)
Long-Chord-Free and Fence-Free Tours for the Travelling.. - Deineko, Woeginger (1995)
(Correct)
Similar documents (at the sentence level):
71.3%: The Convex-Hull-and-Line Traveling Salesman Problem: A.. - Deineko, van Dal, Rote (1992)
(Correct)
Active bibliography (related documents): More All
0.2: Three Easy Special Cases of the Euclidean Travelling.. - Deineko, Rudolf, van.. (1995)
(Correct)
0.1: On Polyhedra Induced by Point Sets in Space - Hurtado, Toussaint, Trias (2003)
(Correct)
0.1: Simple Polygons with an Infinite Sequence of Deflations - Fevens, Hernandez, Mesa..
(Correct)
Similar documents based on text: More All
0.5: On the Recognition of Permuted Supnick and Incomplete.. - Deineko, Rudolf.. (1994)
(Correct)
0.4: A General Approach To Avoiding Two by Two Submatrices - Deineko, Rudolf, Woeginger (1993)
(Correct)
0.4: The Travelling Salesman Problem on Permuted Monge Matrices - Burkard, Deineko, Woeginger (1995)
(Correct)
Related documents from co-citation: More All
4: line traveling salesman problem (context) - Rote - 1992
3: Order picking in a rectangular warehouse: a solvable case of the travelling sale.. (context) - Ratliff, Rosenthal - 1983
3: Efficient special case algorithms for the N -line planar traveling salesman prob.. (context) - Cutler - 1980
BibTeX entry: (Update)
V. Deineko, R. Van Dal and G. Rote, The convex-hull-and-line traveling salesman problem: a solvable case, Information Processing Letters 51, 1994, 141--148. http://citeseer.ist.psu.edu/deineko92convexhullline.html More
@article{ deineko94convexhullline,
author = "Vladimir G. Deineko and Rene van Dal and G{\"u}nter Rote",
title = "The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case",
journal = "Information Processing Letters",
volume = "51",
number = "3",
pages = "141-148",
year = "1994",
url = "citeseer.ist.psu.edu/deineko92convexhullline.html" }
Citations (may not include all citations):
57
Geometric applications of a matrix-searching algorithm (context) - Aggarwal, Klawe et al. - 1987
14
The traveling-salesman problem (context) - Flood - 1956
12
The Euclidean traveling salesman problem is NP - complete (context) - Papadimitriou - 1977
7
On some properties of shortest Hamiltonian circuits (context) - Quintas - 1965
6
line traveling salesman problem (context) - Rote - 1992
2
cient special case algorithms for the N-line planar travelin.. (context) - Cutler - 1980
Documents on the same site (http://www.inf.fu-berlin.de/~rote/Feroffentlichungen.html): More
Computing The Minimum Hausdorff Distance Between Two Point Sets .. - Günter Rote (1991)
(Correct)
Spherical Dispersion With An Application - Günter Rote, Robert F. Tichy (1995)
(Correct)
On the Distribution of Sums of Vectors in General Position - Jerrold R. Griggs, Günter.. (1997)
(Correct)
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