{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:49:08Z","timestamp":1742914148210,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046170"},{"type":"electronic","value":"9783030046187"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-04618-7_18","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T20:47:58Z","timestamp":1542401278000},"page":"221-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New LP Relaxations for Minimum Cycle\/Path\/Tree Cover Problems"],"prefix":"10.1007","author":[{"given":"Wei","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoguang","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"18_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\u201318 (2006)","journal-title":"J. Algorithms"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-17514-5_17","volume-title":"Algorithms and Computation","author":"B Bhattacharya","year":"2010","unstructured":"Bhattacharya, B., Hu, Y.: Approximation algorithms for the multi-vehicle scheduling problem. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6507, pp. 192\u2013205. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17514-5_17"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"AM Campbell","year":"2008","unstructured":"Campbell, A.M., Vandenbussche, D., Hermann, W.: Routing for relief efforts. Transp. Sci. 42, 127\u2013145 (2008)","journal-title":"Transp. Sci."},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G Even","year":"2004","unstructured":"Even, G., Garg, N., Koemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32, 309\u2013315 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"18_CR5","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."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Z. Friggstad, C. Swamy, Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. In: The Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 744\u2013753 (2014)","DOI":"10.1145\/2591796.2591840"},{"key":"18_CR7","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":"18_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.A. (eds.): The Vehicle Routing Problem: Latest Advances and New Challenges. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.7155\/jgaa.00230","volume":"15","author":"S Karakawa","year":"2011","unstructured":"Karakawa, S., Morsy, E., Nagamochi, H.: Minmax tree cover in the Euclidean space. J. Graph Algorithms Appl. 15, 345\u2013371 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1016\/S0166-218X(02)00596-6","volume":"129","author":"Y Karuno","year":"2003","unstructured":"Karuno, Y., Nagamochi, H.: 2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. Discret. Appl. Math. 129, 433\u2013447 (2003)","journal-title":"Discret. Appl. Math."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00453-012-9740-5","volume":"69","author":"MR Khani","year":"2014","unstructured":"Khani, M.R., Salavatipour, M.R.: Approximation algorithms for min-max tree cover and bounded tree cover problems. Algorithmica 69, 443\u2013460 (2014)","journal-title":"Algorithmica"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11830924_21","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V Nagarajan","year":"2006","unstructured":"Nagarajan, V., Ravi, R.: Minimum vehicle routing with a common deadline. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX\/RANDOM -2006. LNCS, vol. 4110, pp. 212\u2013223. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11830924_21"},{"key":"18_CR13","unstructured":"Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Carnegie Mellon University, Pittsburgh, Tepper School of Business (2008)"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/net.20435","volume":"59","author":"V Nagarajan","year":"2012","unstructured":"Nagarajan, V., Ravi, R.: Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2), 209\u2013214 (2012)","journal-title":"Networks"},{"volume-title":"The Vehicle Routing Problem","year":"2002","key":"18_CR15","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM, Philadelphia (2002)"},{"key":"18_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-662-04565-7"},{"issue":"3","key":"18_CR17","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":"18_CR18","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.dam.2011.09.014","volume":"160","author":"Z Xu","year":"2012","unstructured":"Xu, Z., Xu, L., Zhu, W.: Approximation results for a min-max location-routing problem. Discret. Appl. Math. 160, 306\u2013320 (2012)","journal-title":"Discret. Appl. Math."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.tcs.2016.01.041","volume":"654","author":"W Yu","year":"2016","unstructured":"Yu, W., Liu, Z.: Improved approximation algorithms for some min-max cycle cover problems. Theor. Comput. Sci. 654, 45\u201358 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-319-78455-7_7","volume-title":"Frontiers in Algorithmics","author":"W Yu","year":"2018","unstructured":"Yu, W., Liu, Z., Bao, X.: New approximation algorithms for the minimum cycle cover problem. In: Chen, J., Lu, P. (eds.) FAW 2018. LNCS, vol. 10823, pp. 81\u201395. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78455-7_7"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:58:42Z","timestamp":1710338322000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}