{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:35:01Z","timestamp":1743042901466,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_4","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"36-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithms for\u00a0the\u00a0Min-Max Mixed Rural Postmen Cover Problem and\u00a0Its Variants"],"prefix":"10.1007","author":[{"given":"Liting","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"12","key":"4_CR1","doi-asserted-by":"publisher","first-page":"3403","DOI":"10.1016\/j.cor.2005.02.011","volume":"33","author":"D Ahr","year":"2006","unstructured":"Ahr, D., Reinelt, G.: A tabu search algorithm for the min-max $$k$$-Chinese postman problem. Comput. Oper. Res. 33(12), 3403\u20133422 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"4_CR2","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":"3","key":"4_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2006)","journal-title":"Omega"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20334","volume":"54","author":"E Benavent","year":"2009","unstructured":"Benavent, E., Corberan, A., Plana, I., Sanchis, J.M.: Min-Max $$K$$-vehicles windy rural postman problem. Networks 54(4), 216\u2013226 (2009)","journal-title":"Networks"},{"issue":"3","key":"4_CR5","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1002\/net.21742","volume":"70","author":"R Van Bevern","year":"2017","unstructured":"Van Bevern, R., Komusiewicz, C., Sorge, M.: A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: theory and experiments. Networks 70(3), 262\u2013278 (2017)","journal-title":"Networks"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1002\/net.21858","volume":"72","author":"JF Campbell","year":"2018","unstructured":"Campbell, J.F., Corberan, A., Plana, I., Sanchis, J.M.: Drone arc routing problems. Networks 72(4), 543\u2013559 (2018)","journal-title":"Networks"},{"issue":"3","key":"4_CR7","first-page":"68","volume":"18","author":"CC Chyu","year":"2001","unstructured":"Chyu, C.C.: A mixed-strategy heuristic for the mixed arc routing problem. J. Chin. Inst. Ind. Eng. 18(3), 68\u201376 (2001)","journal-title":"J. Chin. Inst. Ind. Eng."},{"key":"4_CR8","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, 88\u2013124 (1973)","journal-title":"Math. Program."},{"key":"4_CR9","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":"4_CR10","doi-asserted-by":"crossref","unstructured":"Fok, K.Y., Cheng, C.T., Chi, K.T.: A refinement process for nozzle path planning in 3D printing. In: 2017 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20134. IEEE (2017)","DOI":"10.1109\/ISCAS.2017.8050471"},{"issue":"3","key":"4_CR11","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. J. ACM 26(3), 538\u2013554 (1979)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR12","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":"2","key":"4_CR13","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."},{"issue":"3","key":"4_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.21563","volume":"64","author":"DS Hochbaum","year":"2014","unstructured":"Hochbaum, D.S., Lyu, C., Ordonez, F.: Security routing games with multivehicle Chinese postman problem. Networks 64(3), 181\u2013191 (2014)","journal-title":"Networks"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problems. Networks 6(3), 273\u2013280 (1976)","DOI":"10.1002\/net.3230060305"},{"issue":"1","key":"4_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/net.3230040105","volume":"4","author":"CS Orloff","year":"1974","unstructured":"Orloff, C.S.: A fundamental problem in vehicle routing. Networks 4(1), 35\u201364 (1974)","journal-title":"Networks"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1145\/321958.321974","volume":"23","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: On the complexity of edge traversing. J. ACM 23(3), 544\u2013554 (1976)","journal-title":"J. ACM"},{"key":"4_CR18","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-32363-5_4","volume-title":"Recent Advances in Memetic Algorithms","author":"C Prins","year":"2005","unstructured":"Prins, C., Bouchenoua, S.: A memetic algorithm solving the VRP, the CARP and general routing problems with nodes, edges and arcs. In: Hart, W.E., Smith, J.E., Krasnogor, N. (eds.) Recent Advances in Memetic Algorithms. STUDFUZZ, vol. 166, pp. 65\u201385. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-32363-5_4"},{"issue":"4","key":"4_CR19","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/S0895480197331454","volume":"12","author":"B Raghavachari","year":"1999","unstructured":"Raghavachari, B., Veerasamy, J.: A 3\/2-approximation algorithm for the mixed postman problem. SIAM J. Discret. Math. 12(4), 425\u2013433 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"4_CR20","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":"7","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1016\/j.cor.2011.08.014","volume":"39","author":"MA Salazar-Aguilar","year":"2012","unstructured":"Salazar-Aguilar, M.A., Langevin, A., Laporte, G.: Synchronized arc routing for snow plowing operations. Comput. Oper. Res. 39(7), 1432\u20131440 (2012)","journal-title":"Comput. Oper. Res."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/978-3-030-92681-6_32","volume-title":"Combinatorial Optimization and Applications","author":"Y Sun","year":"2021","unstructured":"Sun, Y., Yu, W., Liu, Z.: Approximation algorithms for some min-max and minimum stacker crane cover problems. In: Du, D.-Z., Du, D., Wu, C., Xu, D. (eds.) COCOA 2021. LNCS, vol. 13135, pp. 400\u2013415. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92681-6_32"},{"issue":"1","key":"4_CR23","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1137\/20M1339313","volume":"51","author":"V Traub","year":"2022","unstructured":"Traub, V., Vygen, J.: An improved approximation algorithm for the asymmetric traveling salesman problem. SIAM J. Comput. 51(1), 139\u2013173 (2022)","journal-title":"SIAM J. Comput."},{"issue":"11","key":"4_CR24","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1016\/j.cor.2009.05.006","volume":"37","author":"P Vansteenwegen","year":"2010","unstructured":"Vansteenwegen, P., Souffriau, W., Sorensen, K.: Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows. Comput. Oper. Res. 37(11), 1870\u20131876 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1057\/jors.2011.26","volume":"63","author":"EJ Willemse","year":"2012","unstructured":"Willemse, E.J., Joubert, J.W.: Applying minCmax $$k$$ postmen problems to the routing of security guards. J. Oper. Res. Soc. 63(2), 245\u2013260 (2012)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"4_CR26","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 minCmax postmen cover problems. Ann. Oper. Res. 300(1), 267\u2013287 (2021)","journal-title":"Ann. Oper. Res."}],"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-3-031-22105-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:03:27Z","timestamp":1680213807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","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":"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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}