Abstract
The expander graph constructions and their variants are the main tool used in gap preserving reductions to prove approximation lower bounds of combinatorial optimisation problems. In this paper we introduce the weighted amplifiers and weighted low occurrence of Constraint Satisfaction problems as intermediate steps in the NP-hard gap reductions. Allowing the weights in intermediate problems is rather natural for the edge-weighted problems as Travelling Salesman or Steiner Tree. We demonstrate the technique for Travelling Salesman and use the parametrised weighted amplifiers in the gap reductions to allow more flexibility in fine-tuning their expanding parameters. The purpose of this paper is to point out effectiveness of these ideas, rather than to optimise the expander’s parameters. Nevertheless, we show that already slight improvement of known expander values modestly improve the current best approximation hardness value for TSP from \(\frac{123}{122}\) ([9]) to \(\frac{117}{116}\). This provides a new motivation for study of expanding properties of random graphs in order to improve approximation lower bounds of TSP and other edge-weighted optimisation problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Böckenhauer, H.-J., Hromkovič, J., Klasing, R., Seibert, S., Unger, W.: An improved lower bound on the approximability of metric TSP and approximation algorithms for the TSP with sharpened triangle inequality. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 382–394. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-46541-3_32
Chlebík, M., Chlebíková, J.: Approximation hardness for small occurrence instances of NP-hard problems. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol. 2653, pp. 152–164. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-44849-7_21
Chlebík, M., Chlebíková, J.: The Steiner tree problem on graphs: inapproximability results. Theor. Comput. Sci. 406, 207–214 (2008)
Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem, Technical report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh PA (1976)
Engebretsen, L.: An explicit lower bound for TSP with distances one and two. Algorithmica 35(4), 301–319 (2003). Preliminary version in STACS 1999
Gharan, O.S., Saberi, A., Singh, M.: A randomized rounding approach to the traveling salesman problem. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS, pp. 550–559 (2011)
Håstad, J.: Some optimal inapproximability results. J. ACM 48, 798–859 (2001)
Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18, 1138–1162 (1970)
Karpinski, M., Lampis, M., Schmied, R.: New inapproximability bounds for TSP. J. Comput. Syst. Sci. 81, 1665–1677 (2015)
Lampis, M.: Improved inapproximability for TSP. Theory Comput. 10(9), 217–236 (2014)
Mömke, T., Svensson, O.: Approximating graphic TSP by matchings. In: IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 560–569 (2011)
Mucha, M.: 13/9-approximation for graphic TSP. Theory Comput. Syst. 55(4), 640–657 (2014)
Papadimitriou, C.H., Yannakakis, M.: The Traveling Salesman Problem with distances one and two. Math. Oper. Res. 18(1), 1–11 (1993)
Papadimitriou, C.H., Vempala, S.: On the approximability of the Traveling Salesman Problem. Combinatorica 26(1), 101–120 (2006)
Sebö, A., Vygen, J.: Shorter tours by nicer ears: 7/5-approximation for the graph-TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Combinatorica 34(5), 597–629 (2014)
Svensson, O.: Overview of new approaches for approximating TSP. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 5–11. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-45043-3_2
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chlebík, M., Chlebíková, J. (2019). Approximation Hardness of Travelling Salesman via Weighted Amplifiers. In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-030-26176-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26175-7
Online ISBN: 978-3-030-26176-4
eBook Packages: Computer ScienceComputer Science (R0)