Abstract
Worst-case analysis is a performance measure that is often too pessimistic to indicate which algorithms we should use in practice. A classical example is in the context of the Euclidean Traveling Salesman Problem (TSP) in the plane, where local search performs extremely well in practice even though it only achieves an \(\varOmega (\frac{\log n}{\log \log n})\) worst-case approximation ratio. In such cases, a natural alternative approach to worst-case analysis is to analyze the performance of algorithms in semi-random models.
In this paper, we propose and investigate a novel semi-random model for the Euclidean TSP. In this model, called the simultaneous semi-random model, an instance over n points consists of the union of an adversarial instance over \((1-\alpha )n\) points and a random instance over \(\alpha n\) points, for some \(\alpha \in [0, 1]\). As with smoothed analysis, the semi-random model interpolates between distributional (random) analysis when \(\alpha = 1\) and worst-case analysis when \(\alpha = 0\). In contrast to smoothed analysis, this model trades off allowing some completely random points in order to have other points that exhibit a fully arbitrary structure.
We show that with only an \(\alpha = \frac{1}{\log n}\) fraction of the points being random, local search achieves an \(\mathcal {O}(\log \log n)\) approximation in the simultaneous semi-random model for Euclidean TSP in fixed dimensions. On the other hand, we show that at least a polynomial number of random points are required to obtain an asymptotic improvement in the approximation ratio of local search compared to its worst-case approximation, even in two dimensions.
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 subscriptionsReferences
Antoniadis, A., Fleszar, K., Hoeksma, R., Schewior, K.: A PTAS for Euclidean TSP with hyperplane neighborhoods. In: SODA, pp. 1089–1105. SIAM (2019)
Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press (2011)
Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM (JACM) 45(5), 753–782 (1998)
Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. In: FOCS, pp. 153–164. IEEE (2006)
Asadpour, A., Goemans, M.X., Madry, A., Gharan, S.O., Saberi, A.: An \({O} (\log n/\log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem. Oper. Res. 65(4), 1043–1061 (2017)
Blum, A., Spencer, J.: Coloring random and semi-random k-colorable graphs. J. Algorithms 19(2), 204–234 (1995)
Brodowsky, U.A., Hougardy, S.: The approximation ratio of the 2-opt heuristic for the Euclidean traveling salesman problem. arXiv preprint arXiv:2010.02583 (2020)
Chandra, B., Karloff, H., Tovey, C.: New results on the old k-opt algorithm for the traveling salesman problem. SIAM J. Comput. 28(6), 1998–2029 (1999)
Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group (1976)
Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393–410 (1954)
David, R., Feige, U.: On the effect of randomness on planted 3-coloring models. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 77–90 (2016)
Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-opt algorithm for the TSP. Algorithmica 68(1), 190–264 (2014)
Englert, M., Röglin, H., Vöcking, B.: Smoothed analysis of the 2-opt algorithm for the general TSP. TALG 13(1), 1–15 (2016)
Feige, U., Kilian, J.: Heuristics for semirandom graph problems. J. Comput. Syst. Sci. 63(4), 639–671 (2001)
Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: Proceedings of the Eighth Annual ACM Symposium on Theory of Computing, pp. 10–22 (1976)
Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Ind. Appl. Math. 10(1), 196–210 (1962)
Johnson, D.S., McGeoch, L.A.: 8. The traveling salesman problem: a case study. In: Local Search in Combinatorial Optimization, pp. 215–310. Princeton University Press (2018)
Karlin, A.R., Klein, N., Gharan, S.O.: A (slightly) improved approximation algorithm for metric TSP. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 32–45 (2021)
Karp, R.M.: Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane. Math. Oper. Res. 2(3), 209–224 (1977)
Klein, P.N.: A linear-time approximation scheme for tsp in undirected planar graphs with edge-weights. SIAM J. Comput. 37(6), 1926–1952 (2008)
Kolla, A., Makarychev, K., Makarychev, Y.: How to play unique games against a semi-random adversary: study of semi-random models of unique games. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 443–452. IEEE (2011)
Künnemann, M., Manthey, B.: Towards understanding the smoothed approximation ratio of the 2-opt heuristic. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 859–871. Springer, Heidelberg (2015). https://doi.org/10.1007/978-3-662-47672-7_70
Makarychev, K., Makarychev, Y., Vijayaraghavan, A.: Approximation algorithms for semi-random partitioning problems. In: STOC, pp. 367–384 (2012)
Mömke, T., Svensson, O.: Removing and adding edges for the traveling salesman problem. J. ACM (JACM) 63(1), 1–28 (2016)
Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60–100 (1991)
Papadimitriou, C.H.: The Euclidean travelling salesman problem is NP-complete. Theor. Comput. Sci. 4(3), 237–244 (1977)
Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)
Roughgarden, T.: Beyond the Worst-Case Analysis of Algorithms. Cambridge University Press (2021)
Spielman, D.A., Teng, S.H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM (JACM) 51(3), 385–463 (2004)
Steele, J.M.: Probability Theory and Combinatorial Optimization. SIAM (1997)
Svensson, O., Tarnawski, J., Végh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. J. ACM (JACM) 67(6), 1–53 (2020)
Traub, V., Vygen, J.: Approaching 3/2 for the \(s\)-\(t\)-path TSP. J. ACM (JACM) 66(2), 1–17 (2019)
Vijayaraghavan, A., Awasthi, P.: Clustering semi-random mixtures of Gaussians. In: ICML, pp. 5055–5064. PMLR (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Balkanski, E., Faenza, Y., Kubik, M. (2022). The Simultaneous Semi-random Model for TSP. In: Aardal, K., Sanità, L. (eds) Integer Programming and Combinatorial Optimization. IPCO 2022. Lecture Notes in Computer Science, vol 13265. Springer, Cham. https://doi.org/10.1007/978-3-031-06901-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-031-06901-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-06900-0
Online ISBN: 978-3-031-06901-7
eBook Packages: Computer ScienceComputer Science (R0)