{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:29Z","timestamp":1742913689622,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_12","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"147-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing 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"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"12_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. Journal of Algorithms 59, 1\u201318 (2006)","journal-title":"Journal of Algorithms"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM 45, 753\u2013782 (1998)","journal-title":"Journal of the ACM"},{"key":"12_CR3","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, Part II. LNCS, vol. 6507, pp. 192\u2013205. Springer, Heidelberg (2010)"},{"key":"12_CR4","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. Transportation Science 42, 127\u2013145 (2008)","journal-title":"Transportation Science"},{"key":"12_CR5","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA (1976)"},{"key":"12_CR6","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. Operations Research Letters 32, 309\u2013315 (2004)","journal-title":"Operations Research Letters"},{"issue":"2","key":"12_CR7","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 Journal on Computing 7(2), 178\u2013193 (1978)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Friggstad, Z., Swamy, C.: 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":"12_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. Journal of Graph Algorithms and Applications 15, 345\u2013371 (2011)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"12_CR10","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":"12_CR11","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1093\/ietfec\/e88-a.5.1335","volume":"E88\u2013A","author":"H Nagamochi","year":"2005","unstructured":"Nagamochi, H.: Approximating the minmax rooted-subtree cover problem. IEICE Transactions on Fundamentals of Electronics E88\u2013A, 1335\u20131338 (2005)","journal-title":"IEICE Transactions on Fundamentals of Electronics"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-540-24587-2_16","volume-title":"Algorithms and Computation","author":"H Nagamochi","year":"2003","unstructured":"Nagamochi, H., Okada, K.: Polynomial time 2-approximation algorithms for the minmax subtree cover problem. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 138\u2013147. Springer, Heidelberg (2003)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.ipl.2007.06.012","volume":"104","author":"H Nagamochi","year":"2007","unstructured":"Nagamochi, H., Okada, K.: Approximating the minmax rooted-tree cover in a tree. Information Processing Letters 104, 173\u2013178 (2007)","journal-title":"Information Processing Letters"},{"issue":"2","key":"12_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"},{"key":"12_CR15","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.2295609","author":"W Xu","year":"2013","unstructured":"Xu, W., Liang, W., Lin, X.: Approximation algorithms for Min-max Cycle Cover Problems. IEEE Transactions on Computers (2013). doi:10.1109\/TC.2013.2295609","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.orl.2010.04.009","volume":"38","author":"Z Xu","year":"2010","unstructured":"Xu, Z., Wen, Q.: Approximation hardness of min-max tree covers. Operations Research Letters 38, 408\u2013416 (2010)","journal-title":"Operations Research Letters"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"728","DOI":"10.1002\/nav.20434","volume":"57","author":"Z Xu","year":"2010","unstructured":"Xu, Z., Xu, L., Li, C.-L.: Approximation results for min-max path cover problems in vehicle routing. Naval Research Logistics 57, 728\u2013748 (2010)","journal-title":"Naval Research Logistics"},{"key":"12_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. Discrete Applied Mathematics 160, 306\u2013320 (2012)","journal-title":"Discrete Applied Mathematics"}],"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-319-21398-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:32:28Z","timestamp":1674228748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}