The Traveling Salesman Problem with Few Inner Points

  • Vladimir G. Deineko
  • Michael Hoffmann
  • Yoshio Okamoto
  • Gerhard J. Woeginger
Conference paper

DOI: 10.1007/978-3-540-27798-9_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3106)
Cite this paper as:
Deineko V.G., Hoffmann M., Okamoto Y., Woeginger G.J. (2004) The Traveling Salesman Problem with Few Inner Points. In: Chwa KY., Munro J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg

Abstract

We study the traveling salesman problem (TSP) in the 2-dimensional Euclidean plane. The problem is NP-hard in general, but trivial if the points are in convex position. In this paper, we investigate the influence of the number of inner points (i.e., points in the interior of the convex hull) on the computational complexity of the problem. We give two simple algorithms for this problem. The first one runs in O(k!kn) time and O(k) space, and the second runs in O(2kk2n) time and O(2kkn) space, when n is the total number of input points and k is the number of inner points. Hence, if k is taken as a parameter, this problem is fixed-parameter tractable (FPT), and also can be solved in polynomial time if k=O(log n). We also consider variants of the TSP such as the prize-collecting TSP and the partial TSP in this setting, and show that they are FPT as well.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Vladimir G. Deineko
    • 1
  • Michael Hoffmann
    • 2
  • Yoshio Okamoto
    • 2
  • Gerhard J. Woeginger
    • 3
  1. 1.Warwick Business SchoolThe University of WarwickConventryUnited Kingdom
  2. 2.Institute of Theoretical Computer ScienceETH ZurichZurichSwitzerland
  3. 3.Department of Mathematics and Computer ScienceTU EindhovenEindhovenThe Netherlands

Personalised recommendations