{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:40:04Z","timestamp":1767339604651,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_27","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"380-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Candidate Carpooling Routing Problem and\u00a0Its Approximation Algorithms"],"prefix":"10.1007","author":[{"given":"Jiale","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Xiuqi","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Zifeng","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiaofeng","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Guihai","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Asadpour, A., Goemans, M.X., Ma\u0327dry, A., Gharan, S.O., Saberi, A.: An $$\\rm O (\\log n\/\\log \\log n)$$-approximation algorithm for the asymmetric traveling salesman problem. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 379\u2013389 (2010)","DOI":"10.1137\/1.9781611973075.32"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Bateni, M., Demaine, E.D., Hajiaghayi, M., Marx, D.: A PTAS for planar group steiner tree via spanner bootstrapping and prize collecting. In: ACM Symposium on Theory of Computing (STOC), pp. 570\u2013583 (2016)","DOI":"10.1145\/2897518.2897549"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.jda.2013.04.002","volume":"21","author":"HJ B\u00f6ckenhauer","year":"2013","unstructured":"B\u00f6ckenhauer, H.J., M\u00f6mke, T., Steinov\u00e1, M.: Improved approximations for tsp with simple precedence constraints. J. Discrete Algorithms 21, 32\u201340 (2013)","journal-title":"J. Discrete Algorithms"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chekuri, C., Goel, A., Guha, S.: Rounding via trees: deterministic approximation algorithms for group steiner trees and k-median. In: ACM Symposium on Theory of Computing (STOC), pp. 114\u2013123 (1998)","DOI":"10.1145\/276698.276719"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.4086\/toc.2007.v003a010","volume":"3","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., P\u00e1l, M.: An $$\\rm O (\\log n)$$ approximation ratio for the asymmetric traveling salesman path problem. Theory Comput. 3(1), 197\u2013209 (2007)","journal-title":"Theory Comput."},{"key":"27_CR6","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Carnegie-Mellon University Pittsburgh Pa Management Sciences Research Group, Technical Report (1976)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Elbassioni, K., Fishkin, A.V., Mustafa, N.H., Sitters, R.: Approximation algorithms for Euclidean group tsp. In: International Colloquium on Automata, Languages and Programming (ICALP), pp. 1115\u20131126 (2005)","DOI":"10.1007\/11523468_90"},{"issue":"9","key":"27_CR8","doi-asserted-by":"publisher","first-page":"3356","DOI":"10.1016\/j.amc.2009.10.027","volume":"215","author":"M Fatih Tasgetiren","year":"2010","unstructured":"Fatih Tasgetiren, M., Suganthan, P.N., Pan, Q.K.: An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem. Appl. Math. Comput. 215(9), 3356\u20133368 (2010). https:\/\/doi.org\/10.1016\/j.amc.2009.10.027","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"27_CR9","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/net.3230120103","volume":"12","author":"AM Frieze","year":"1982","unstructured":"Frieze, A.M., Galbiati, G., Maffioli, F.: On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12(1), 23\u201339 (1982)","journal-title":"Networks"},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"issue":"6","key":"27_CR11","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held, M., Karp, R.M.: The traveling-salesman problem and minimum spanning trees. Oper. Res. 18(6), 1138\u20131162 (1970)","journal-title":"Oper. Res."},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s12532-015-0080-8","volume":"7","author":"K Helsgaun","year":"2015","unstructured":"Helsgaun, K.: Solving the equality generalized traveling salesman problem using the Lin\u2013Kernighan\u2013Helsgaun Algorithm. Math. Program. Comput. 7(3), 269\u2013287 (2015). https:\/\/doi.org\/10.1007\/s12532-015-0080-8","journal-title":"Math. Program. Comput."},{"issue":"5","key":"27_CR13","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."},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Hu, G., Shao, J., Shen, F., Huang, Z., Shen, H.T.: Unifying multi-source social media data for personalized travel route planning. In: ACM International Conference on Research and Development in Information Retrieval (SIGIR), pp. 893\u2013896 (2017)","DOI":"10.1145\/3077136.3080672"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Karlin, A.R., Klein, N., Oveis Gharan, S.: A deterministic better-than-3\/2 approximation algorithm for metric tsp. In: International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 261\u2013274 (2023)","DOI":"10.1007\/978-3-031-32726-1_19"},{"key":"27_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1134\/S0081543817090127","volume":"299","author":"MY Khachai","year":"2017","unstructured":"Khachai, M.Y., Neznakhina, E.: Approximation schemes for the generalized traveling salesman problem. Proc. Steklov Inst. Math. 299, 97\u2013105 (2017)","journal-title":"Proc. Steklov Inst. Math."},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Liu, H., Luo, K., Xu, Y., Zhang, H.: Car-sharing problem: online scheduling with flexible advance bookings. In: Annual International Conference on Combinatorial Optimization and Applications (COCOA), pp. 340\u2013351 (2019)","DOI":"10.1007\/978-3-030-36412-0_27"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"100029","DOI":"10.1016\/j.ejco.2022.100029","volume":"10","author":"J Schmidt","year":"2022","unstructured":"Schmidt, J., Irnich, S.: New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem. EURO J. Comput. Optim. 10, 100029 (2022). https:\/\/doi.org\/10.1016\/j.ejco.2022.100029","journal-title":"EURO J. Comput. Optim."},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Sebo, A., Van Zuylen, A.: The salesman\u2019s improved paths: A 3\/2+ 1\/34 approximation. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 118\u2013127 (2016)","DOI":"10.1109\/FOCS.2016.21"},{"key":"27_CR20","first-page":"76","volume":"17","author":"AI Serdyukov","year":"1978","unstructured":"Serdyukov, A.I.: Some extremal bypasses in graphs. Diskretnyi Analiz i Issledovanie Operatsii 17, 76\u201379 (1978)","journal-title":"Diskretnyi Analiz i Issledovanie Operatsii"},{"issue":"6","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3424306","volume":"67","author":"O Svensson","year":"2020","unstructured":"Svensson, O., Tarnawski, J., V\u00e9gh, L.A.: A constant-factor approximation algorithm for the asymmetric traveling salesman problem. J. ACM 67(6), 1\u201353 (2020)","journal-title":"J. ACM"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: A 1.5-approximation for path TSP. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1539\u20131549 (2019)","DOI":"10.1137\/1.9781611975482.93"},{"key":"27_CR23","doi-asserted-by":"publisher","first-page":"120231","DOI":"10.1016\/j.eswa.2023.120231","volume":"227","author":"T Zheng","year":"2023","unstructured":"Zheng, T., Jiang, Y.: Driver-rider matching and route optimization in carpooling service for delivering intercity commuters to the high-speed railway station. Expert Syst. Appl. 227, 120231 (2023)","journal-title":"Expert Syst. Appl."}],"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-031-49611-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:08:58Z","timestamp":1707556138000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","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":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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)"}}]}}