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(2k k 2 n) time and O(2k kn) 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, S.: Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J. ACM 45, 753–782 (1998)
Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)
Bellman, R.: Dynamic programming treatment of the traveling salesman problem. J. ACM 9, 61–63 (1962)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press, Cambridge (2001)
Deĭneko, V., van Dal, R., Rote, G.: The convex-hull-and-line traveling salesman problem: a solvable case. Inf. Process. Lett. 59, 295–301 (1996)
Deĭneko, V., Woeginger, G.J.: The convex-hull-and-k-line traveling salesman problem. Inf. Process. Lett. 59, 295–301(1996)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Berlin (1999)
Flood, M.M.: Traveling salesman problem. Oper. Res. 4, 61–75 (1956)
Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proc. 8th STOC, pp. 10–22 (1976)
Held, M., Karp, R.: A dynamic programming approach to sequencing problems. J. SIAM 10, 196–210 (1962)
Hoffmann, M., Okamoto, Y.: The minimum weight triangulation problem with few inner points (submitted)
Hwang, R.Z., Chang, R.C., Lee, R.C.T.: The searching over separators strategy to solve some NP-hard problems in subexponential time. Algorithmica 9, 398–423 (1993)
Mitchell, J.: Guillotine subdivisions approximate polygonal subdivisions: a simple polynomial- time approximation scheme for geometric k-MST, TSP, and related problems. SIAM J. Comput. 28, 1298–1309 (1999)
Niedermeier, R.: Invitation to fixed-parameter algorithms. Habilitation Thesis, Universität Tübingen (2002)
Papadimitriou, C.H.: Euclidean TSP is NP-complete. Theor. Comput. Sci. 4, 237–244 (1977)
Rao, S., Smith, W.: Approximating geometric graphs via spanners and banyans. In: Proc. 30th STOC, pp. 540–550 (1998)
Sedgewick, R.: Permutation generation methods. ACM Comput. Surveys 9, 137–164 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-540-27798-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive