The traveling salesman problem with few inner points (2004)
Cached
Download Links
- [www.algo.ics.tut.ac.jp]
- [www.inf.ethz.ch]
- [www.inf.ethz.ch]
- DBLP
Other Repositories/Bibliography
by
Vladimir G. Deĭneko
,
Michael Hoffmann
,
Yoshio Okamoto
,
Gerhard J. Woeginger
| Venue: | In Proc. 10th COCOON, volume 3106 of LNCS |
| Citations: | 9 - 2 self |
BibTeX
@INPROCEEDINGS{Deĭneko04thetraveling,
author = {Vladimir G. Deĭneko and Michael Hoffmann and Yoshio Okamoto and Gerhard J. Woeginger},
title = {The traveling salesman problem with few inner points},
booktitle = {In Proc. 10th COCOON, volume 3106 of LNCS},
year = {2004},
pages = {268--277},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We propose two algorithms for the planar Euclidean traveling salesman problem. The first runs in O(k!kn) time and O(k) space, and the second runs in O(2 k k 2 n) time and O(2 k kn) space, where n denotes the number of input points and k denotes the number of points interior to the convex hull.
