{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:32:19Z","timestamp":1742927539206,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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:\/\/2.zoppoz.workers.dev:443\/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:\/\/2.zoppoz.workers.dev:443\/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_32","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"400-415","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for Some Min-Max and Minimum Stacker Crane Cover Problems"],"prefix":"10.1007","author":[{"given":"Yuhui","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-6127-1264","authenticated-orcid":false,"given":"Wei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-1215-7622","authenticated-orcid":false,"given":"Zhaohui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"issue":"1","key":"32_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"EM Arkin","year":"2006","unstructured":"Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1), 1\u201318 (2006)","journal-title":"J. Algorithms"},{"issue":"5","key":"32_CR2","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1137\/0217053","volume":"17","author":"MJ Atallah","year":"1988","unstructured":"Atallah, M.J., Kosaraju, S.R.: Efficient solutions to some transportation problems with applications to minimizing robot arm travel. SIAM J. Comput. 17(5), 849\u2013869 (1988)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"32_CR3","first-page":"107","volume":"25","author":"X Bao","year":"2021","unstructured":"Bao, X., Lu, C., Huang, D., Yu, W.: Approximation algorithm for min-max cycle cover problem on a mixed graph. Oper. Res. Trans. 25(1), 107\u2013113 (2021). [in Chinese]","journal-title":"Oper. Res. Trans."},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10288-006-0018-0","volume":"5","author":"RW Calvo","year":"2007","unstructured":"Calvo, R.W., Colorni, A.: An effective and fast heuristic for the Dial-a-Ride problem. 4OR 5(1), 61\u201373 (2007). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10288-006-0018-0","journal-title":"4OR"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Corberan, A., Laporte, G.: Arc Routing: problems, methods, and applications. In: SIAM, Philadelphia, pp. 101\u2013127 (2015)","DOI":"10.1137\/1.9781611973679"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/opre.43.2.231","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part I: the Chinese postman problem. Oper. Res. 43, 231\u2013242 (1995)","journal-title":"Oper. Res."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/opre.43.3.399","volume":"43","author":"HA Eiselt","year":"1995","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Arc routing problems, part II: the rural postman problem. Oper. Res. 43, 399\u2013414 (1995)","journal-title":"Oper. Res."},{"issue":"2","key":"32_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"GN Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"32_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1006\/jagm.1993.1029","volume":"15","author":"GN Frederickson","year":"1993","unstructured":"Frederickson, G.N., Guan, D.J.: Nonpreemptive ensemble motion planning on a tree. J. Algorithms 15(1), 29\u201360 (1993)","journal-title":"J. Algorithms"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1109\/TNET.2018.2815630","volume":"26","author":"X Gao","year":"2018","unstructured":"Gao, X., Fan, J., Wu, F., Chen, G.: Approximation algorithms for sweep coverage problem with multiple mobile sensors. IEEE\/ACM Trans. Netw. 26(2), 990\u20131003 (2018)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"32_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"32_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-030-36412-0_30","volume-title":"Combinatorial Optimization and Applications","author":"Y Mao","year":"2019","unstructured":"Mao, Y., Yu, W., Liu, Z., Xiong, J.: Approximation algorithms for some minimum postmen cover problems. In: Li, Y., Cardei, M., Huang, Y. (eds.) COCOA 2019. LNCS, vol. 11949, pp. 375\u2013386. Springer, Cham (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-36412-0_30"},{"issue":"3","key":"32_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.21759","volume":"70","author":"Q Olivier","year":"2017","unstructured":"Olivier, Q., Andre, L., Fabien, L., Olivier, P., Martin, T.: Solving the large-scale min-max $$k$$-rural postman problem for snow plowing. Networks 70(3), 195\u2013215 (2017)","journal-title":"Networks"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"1","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems, Part I: transportation between customers and depot. J. F\u00fcr Betriebswirtschaft 1, 21\u201351 (2008)","journal-title":"J. F\u00fcr Betriebswirtschaft"},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"2","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems, Part II: transportation between pickup and delivery locations. J. F\u00fcr Betriebswirtschaft 2, 81\u2013117 (2008)","journal-title":"J. F\u00fcr Betriebswirtschaft"},{"key":"32_CR16","unstructured":"Safilian, M., Hashemi, S.M., Eghbali, S., Safilian, A.: An approximation algorithm for the Subpath Planning. In: the Proceedings of the 25th International Joint Conference on Artificial Intelligence, pp. 669\u2013675 (2016)"},{"issue":"9","key":"32_CR17","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1109\/TAC.2013.2259993","volume":"58","author":"K Treleaven","year":"2013","unstructured":"Treleaven, K., Pavone, M., Frazzoli, E.: Asymptotically optimal algorithms for one-to-one pickup and delivery problems with applications to transportation systems. IEEE Trans. Autom. Control 58(9), 2261\u20132276 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"32_CR18","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1109\/TC.2013.2295609","volume":"64","author":"W Xu","year":"2015","unstructured":"Xu, W., Liang, W., Lin, X.: Approximation algorithms for min-max cycle cover problems. IEEE Trans. Comput. 64(3), 600\u2013613 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Yu, W., Dai, R., Liu, Z.: Approximation algorithms for multi-vehicle stacker crane problems. J. Oper. Res. Soc. China (2021, to appear)","DOI":"10.1007\/s40305-021-00372-7"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s10479-021-03933-4","volume":"300","author":"W Yu","year":"2021","unstructured":"Yu, W., Liu, Z., Bao, X.: Approximation algorithms for some min-max postmen cover problems. Ann. Oper. Res. 300, 267\u2013287 (2021). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/s10479-021-03933-4","journal-title":"Ann. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T22:23:24Z","timestamp":1673994204000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-030-92681-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":20,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-92681-6_32","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":"https:\/\/2.zoppoz.workers.dev:443\/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)"}}]}}