{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:57:21Z","timestamp":1743145041755,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030692438"},{"type":"electronic","value":"9783030692445"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-69244-5_23","type":"book-chapter","created":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:36:12Z","timestamp":1613838972000},"page":"264-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for the General Cluster Routing Problem"],"prefix":"10.1007","author":[{"given":"Longkun","family":"Guo","sequence":"first","affiliation":[]},{"given":"Bin","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Peihuang","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,21]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, H.: Graph routing problem using Euler\u2019s theorem and its applications (2019)","DOI":"10.31219\/osf.io\/gn8as"},{"issue":"5","key":"23_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. J. ACM (JACM) 62(5), 1\u201328 (2015)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"23_CR3","first-page":"205","volume":"29","author":"EM Arkin","year":"1997","unstructured":"Arkin, E.M., Hassin, R., Klein, L.: Restricted delivery problems on a network. Netw. Int. J. 29(4), 205\u2013216 (1997)","journal-title":"Netw. Int. J."},{"key":"23_CR4","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie-Mellon Univ Pittsburgh Pa Management Sciences Research Group, Technical report (1976)"},{"issue":"5","key":"23_CR5","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/opre.42.5.846","volume":"42","author":"M Fischetti","year":"1994","unstructured":"Fischetti, M., Toth, P., Vigo, D.: A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs. Oper. Res. 42(5), 846\u2013859 (1994)","journal-title":"Oper. Res."},{"key":"23_CR6","series-title":"Combinatorial Optimization","doi-asserted-by":"publisher","DOI":"10.1007\/b101971","volume-title":"The Traveling Salesman Problem and its Variations","author":"G Gutin","year":"2006","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and its Variations. COOP, vol. 12. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/b101971"},{"issue":"4","key":"23_CR7","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(4), 422\u2013437 (2000)","journal-title":"Algorithmica"},{"issue":"5","key":"23_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"J Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.: 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."},{"issue":"6","key":"23_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0020-0190(92)90161-N","volume":"41","author":"K Jansen","year":"1992","unstructured":"Jansen, K.: An approximation algorithm for the general routing problem. Inf. Process. Lett. 41(6), 333\u2013339 (1992)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10107-006-0046-8","volume":"113","author":"F Lam","year":"2008","unstructured":"Lam, F., Newman, A.: Traveling salesman path problems. Math. Program. 113(1), 39\u201359 (2008)","journal-title":"Math. Program."},{"issue":"4","key":"23_CR11","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1057\/jors.1975.151","volume":"26","author":"JK Lenstra","year":"1975","unstructured":"Lenstra, J.K., Kan, A.R.: Some simple applications of the travelling salesman problem. J. Oper. Res. Soc. 26(4), 717\u2013733 (1975)","journal-title":"J. Oper. Res. Soc."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Neumann, F., Witt, C.: Adelaide research and scholarship: Bioinspired computation in combinatorial optimization: algorithms and their computational complexity (2010)","DOI":"10.1007\/978-3-642-16544-3_2"},{"key":"23_CR13","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":"5","key":"23_CR14","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)","journal-title":"Combinatorica"},{"issue":"2","key":"23_CR15","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. J. ACM (JACM) 66(2), 1\u201317 (2019)","journal-title":"J. ACM (JACM)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Traub, V., Vygen, J.: Beating the integrality ratio for s-t-tours in graphs. SIAM J. Comput. (0), FOCS18-37 (2020)","DOI":"10.1137\/18M1227135"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Traub, V., Vygen, J., Zenklusen, R.: Reducing path TSP to TSP. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 14\u201327 (2020)","DOI":"10.1145\/3357713.3384256"},{"key":"23_CR18","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"},{"key":"23_CR19","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","Parallel and Distributed Computing, Applications and Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69244-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,20]],"date-time":"2021-02-20T16:44:54Z","timestamp":1613839494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69244-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692438","9783030692445"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69244-5_23","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":"21 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PDCAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel and Distributed Computing: Applications and Technologies","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pdcat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hpcc.siat.ac.cn\/meeting\/pdcat-paap2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","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":"34","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":"0","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":"31% - 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":"3","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":"6","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)"}}]}}