{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:06:30Z","timestamp":1757617590136,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_18","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:32:50Z","timestamp":1741105970000},"page":"216-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["1.6-Approximation Algorithm for\u00a0Generalized Traveling Salesman Path Problem"],"prefix":"10.1007","author":[{"given":"Rui","family":"Li","sequence":"first","affiliation":[]},{"given":"Xianhao","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Yijing","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.tcs.2021.05.016","volume":"877","author":"L Alfandari","year":"2021","unstructured":"Alfandari, L., Toulouse, S.: Approximation of the double traveling salesman problem with multiple stacks. Theoret. Comput. Sci. 877, 74\u201389 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2818310","volume":"62","author":"HC An","year":"2015","unstructured":"An, H.C., Kleinberg, R., Shmoys, D.B.: Improving Christofides\u2019 algorithm for the ST path TSP. JACM 62(5), 1\u201328 (2015)","journal-title":"JACM"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.tcs.2014.02.046","volume":"531","author":"E Angelelli","year":"2014","unstructured":"Angelelli, E., Bazgan, C., Speranza, M.G., Tuza, Z.: Complexity and approximation for traveling salesman problems with profits. Theor. Comput. Sci. 531, 54\u201365 (2014)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"18_CR4","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. JACM 45(5), 753\u2013782 (1998)","journal-title":"JACM"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. In: Operations Research Forum, vol. 3, p. 20. Springer (2022)","DOI":"10.1007\/s43069-021-00101-z"},{"issue":"1","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"C G\u00e9rard","year":"1985","unstructured":"G\u00e9rard, C., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33(1), 1\u201327 (1985)","journal-title":"Math. Program."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Cunningham, W.H.: Testing membership in matroid polyhedra. J. Comb. Theory Ser. B 36(2), 161\u2013188 (1984)","DOI":"10.1016\/0095-8956(84)90023-6"},{"issue":"4","key":"18_CR8","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling-salesman problem. J. Oper. Res. Soc. Am. 2(4), 393\u2013410 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M., Kawarabayashi, K.I.: Contraction decomposition in h-minor-free graphs and algorithmic applications. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pp. 441\u2013450 (2011)","DOI":"10.1145\/1993636.1993696"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s00493-010-2341-5","volume":"30","author":"ED Demaine","year":"2010","unstructured":"Demaine, E.D., Hajiaghayi, M., Mohar, B.: Approximation algorithms via contraction decomposition. Combinatorica 30, 533\u2013552 (2010)","journal-title":"Combinatorica"},{"issue":"3","key":"18_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","volume":"21","author":"F Bernhard","year":"1985","unstructured":"Bernhard, F.: A cutting plane procedure for the travelling salesman problem on road networks. Eur. J. Oper. Res. 21(3), 307\u2013317 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"18_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"GN Frederickson","year":"1979","unstructured":"Frederickson, G.N.: Approximation algorithms for some postman problems. JACM 26(3), 538\u2013554 (1979)","journal-title":"JACM"},{"issue":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Grigni, M., Koutsoupias, E., Papadimitriou, C.: An approximation scheme for planar graph TSP. In: Proceedings of IEEE 36th Annual Foundations of Computer Science, pp. 640\u2013645. IEEE (1995)","DOI":"10.1109\/SFCS.1995.492665"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations, vol. 12. Springer Science & Business Media (2006)","DOI":"10.1007\/b101971"},{"issue":"5","key":"18_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"JA Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A.: Analysis of Christofides\u2019 heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10(5), 291\u2013295 (1991)","journal-title":"Oper. Res. Lett."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"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\u201345 (2021)","DOI":"10.1145\/3406325.3451009"},{"key":"18_CR18","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. Springer (2010)"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Klein, P.N.: A linear-time approximation scheme for planar weighted TSP.: In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201905), pp. 647\u2013656. IEEE (2005)","DOI":"10.1109\/SFCS.2005.7"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail, O., Spirakis, P.G.: Traveling salesman problems in temporal graphs. Theor. Comput. Sci. 634, 1\u201323 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Vempala, S.: On the approximability of the traveling salesman problem. Combinatorica 26(1), 101\u2013120 (2006)","DOI":"10.1007\/s00493-006-0008-z"},{"issue":"3","key":"18_CR22","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.: P-complete approximation problems. JACM 23(3), 555\u2013565 (1976)","journal-title":"JACM"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Seb\u0151, A.: Eight-fifth approximation for the path TSP. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 362\u2013374. Springer (2013)","DOI":"10.1007\/978-3-642-36694-9_31"},{"issue":"5","key":"18_CR24","first-page":"597","volume":"34","author":"A Seb\u00f6","year":"2014","unstructured":"Seb\u00f6, 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. Comb. 34(5), 597\u2013629 (2014)","journal-title":"Comb."},{"key":"18_CR25","first-page":"76","volume":"17","author":"Anatolii Ivanovich Serdyukov","year":"1978","unstructured":"Anatolii Ivanovich Serdyukov: Some extremal bypasses in graphs. Diskretnyi Analiz i Issledovanie Operatsii 17, 76\u201379 (1978)","journal-title":"Diskretnyi Analiz i Issledovanie Operatsii"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.tcs.2022.11.013","volume":"941","author":"J Sun","year":"2023","unstructured":"Sun, J., Gutin, G., Li, P., Shi, P., Zhang, X.: An LP-based approximation algorithm for the generalized traveling salesman path problem. Theoret. Comput. Sci. 941, 180\u2013190 (2023)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"18_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3309715","volume":"66","author":"V Traub","year":"2019","unstructured":"Traub, V., Vygen, J.: Approaching 3\/2 for the s-t-path TSP. JACM 66(2), 1\u201317 (2019)","journal-title":"JACM"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: A 1.5-approximation for path TSP. In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1539\u20131549. SIAM (2019)","DOI":"10.1137\/1.9781611975482.93"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:59:51Z","timestamp":1757145591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}