Vladimir G. Deineko, Renevan Dal, Günter Rote  Home/Search
Context Related
| inf.fuberlin.de/~...lvable+case.pdf.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: inf.fuberlin.d...offentlichungen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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)
Similar documents based on text: More All
1.2: The Convex-Hull-and-Line Traveling Salesman Problem: A.. - Deineko, van Dal, Rote (1992) (Correct)
0.7: Well-Solvable Special Cases of the TSP: A Survey - Burkard, Deineko, van Dal.. (1995) (Correct)
0.5: Long-Chord-Free and Fence-Free Tours for the Travelling.. - 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