{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:59:38Z","timestamp":1726408778135},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_50","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"641-652","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A LP-based Approximation Algorithm for\u00a0generalized Traveling Salesperson Path Problem"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-4205-9513","authenticated-orcid":false,"given":"Jian","family":"Sun","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2377-0417","authenticated-orcid":false,"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2224-1484","authenticated-orcid":false,"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"5","key":"50_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/2818310","volume":"62","author":"H-C An","year":"2015","unstructured":"An, H.-C., Kleinberg, R., Shmoys, D.-B.: Improving Christofides\u2019 algorithm for the $$s$$-$$t$$ path TSP. J. ACM 62(5), 34 (2015)","journal-title":"J. ACM"},{"key":"50_CR2","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Carnegie-Mellon University of Pittsburgh Pa Management Sciences Research Group (1976)"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"W-H Cunningham","year":"1984","unstructured":"Cunningham, W.-H.: Testing membership in matroid polyhedra. J. Comb. Theory Ser. B 36(2), 161\u2013188 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"50_CR4","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."},{"issue":"1","key":"50_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"Edmonds, J.: Matroids and the greedy algorithm. Math. Program. 1(1), 127\u2013136 (1971)","journal-title":"Math. Program."},{"issue":"1","key":"50_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J Edmonds","year":"1973","unstructured":"Edmonds, J., Johnson, E.-L.: Matching, Euler tours and the Chinese postman. Math. Program. 5(1), 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/322139.322150","volume":"26","author":"G-N Frederickson","year":"1979","unstructured":"Frederickson, G.-N.: Approximation algorithms for some postman problems. J. ACM 26, 538\u2013554 (1979)","journal-title":"J. ACM"},{"key":"50_CR8","first-page":"39","volume":"13","author":"L Fumei","year":"2008","unstructured":"Fumei, L., Alantha, N.: Traveling salesman path problems. Math. Progrom. 13, 39\u201359 (2008)","journal-title":"Math. Progrom."},{"issue":"2","key":"50_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"50_CR10","volume-title":"The Traveling Salesman Problem and its Variations","author":"G Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.: The Traveling Salesman Problem and its Variations. Kluwer, Dordrecht (2002)"},{"key":"50_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s004530010045","volume":"28","author":"N Guttmann-Beck","year":"2000","unstructured":"Guttmann-Beck, N., Hassin, R., Khuller, S., Raghavachari, B.: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem. Algorithmica 28, 422\u2013437 (2000)","journal-title":"Algorithmica"},{"key":"50_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"J-A Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.-A.: Analysis of Christofides\u2019 heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10, 291\u2013295 (1991)","journal-title":"Oper. Res. Lett."},{"key":"50_CR13","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":"50_CR14","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume":"2","author":"R-M Karp","year":"1972","unstructured":"Karp, R.-M.: Reducibility among combinatorial problems. Complex. Comput. Comput. 2, 85\u2013103 (1972)","journal-title":"Complex. Comput. Comput."},{"issue":"1","key":"50_CR15","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/2739008","volume":"63","author":"T M\u00f6mke","year":"2016","unstructured":"M\u00f6mke, T., Svensson, O.: Removing and adding edges for the traveling salesman problem. J. ACM 63(1), 2 (2016)","journal-title":"J. ACM"},{"key":"50_CR16","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/s00224-012-9439-7","volume":"55","author":"M Mucha","year":"2014","unstructured":"Mucha, M.: 13\/9-approximation for graphic TSP. Theory Comput. Syst. 55, 640\u2013657 (2014)","journal-title":"Theory Comput. Syst."},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Gharan, S.-O., Saberi, A., Singh, M.: A randomized rounding approach to the traveling salesman problem (2011)","DOI":"10.1109\/FOCS.2011.80"},{"issue":"3","key":"50_CR18","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S., Gonzales, T.: $$P$$-complete approximation problems. J. ACM 23(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"50_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-36694-9_31","volume-title":"Integer Programming and Combinatorial Optimization","author":"A Seb\u0151","year":"2013","unstructured":"Seb\u0151, A.: Eight-Fifth approximation for the path TSP. In: Goemans, M., Correa, J. (eds.) IPCO 2013. LNCS, vol. 7801, pp. 362\u2013374. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36694-9_31"},{"issue":"4","key":"50_CR20","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/3326123","volume":"66","author":"A Seb\u00f6","year":"2019","unstructured":"Seb\u00f6, A., Van Zuylen, A.: The salesman\u2019s improved paths through forests. J. ACM 66(4), 28 (2019)","journal-title":"J. ACM"},{"issue":"5","key":"50_CR21","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00493-014-2960-3","volume":"34","author":"A Seb\u0151","year":"2014","unstructured":"Seb\u0151, 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\u2013629 (2014). https:\/\/doi.org\/10.1007\/s00493-014-2960-3","journal-title":"Combinatorica"},{"issue":"2","key":"50_CR22","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/3309715","volume":"66","author":"V Traub","year":"2019","unstructured":"Traub, V., Vygen, J.: Approaching $$\\frac{3}{2}$$ for the $$s$$-$$t$$ path TSP. J. ACM 66(2), 14 (2019)","journal-title":"J. ACM"},{"key":"50_CR23","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.-A.: $$1.5$$-Approximation for path TSP. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1539\u20131549 (2019)","DOI":"10.1137\/1.9781611975482.93"},{"key":"50_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/978-3-030-58150-3_38","volume-title":"Computing and Combinatorics","author":"X Zhang","year":"2020","unstructured":"Zhang, X., Du, D., Gutin, G., Ming, Q., Sun, J.: Approximation algorithms for general cluster routing problem. In: Kim, D., Uma, R.N., Cai, Z., Lee, D.H. (eds.) COCOON 2020. LNCS, vol. 12273, pp. 472\u2013483. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58150-3_38"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:09:12Z","timestamp":1639354152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}