(Enter summary)
Abstract: In the Euclidean Traveling Salesman Problem, a set of points in the plane is given, and we look for a shortest closed curve through these lines (a "tour"). We treat two special cases of this problem which are solvable in polynomial time. The first solvable case is the N-line Traveling Salesman Problem, where the points lie on a small number (N) of parallel lines. Such problems arise for example in the fabrication of printed circuit boards, where the distance traveled by a laser which drills... (Update)
Similar documents based on text: More All
1.1: Two Solvable Cases of the Traveling Salesman Problem - Rothe
(Correct)
0.8: Formal Group-Theoretic Generalizations of the Necklace Algebra.. - Lenart
(Correct)
0.7: Two solvable cases of the Traveling Salesman Problem - Rothe (1988)
(Correct)
BibTeX entry: (Update)
@misc{ rothe-two,
author = "G{\"u}nter Rothe",
title = "Two solvable cases of the Traveling Salesman Problem",
url = "citeseer.ist.psu.edu/265080.html" }
Citations (may not include all citations):
29
nearest neighbor Voronoi diagrams in the plane (context) - Lee - 1982
2
a Set of Points in the Plane is Sparse (context) - of
1
and notations (context) - facts, nitions
1
for Points in the Plane (context) - of
1
quasi-parallel (context) - of
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