{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T16:32:04Z","timestamp":1775233924672,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,1,19]],"date-time":"2013-01-19T00:00:00Z","timestamp":1358553600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00453-012-9740-5","type":"journal-article","created":{"date-parts":[[2013,1,18]],"date-time":"2013-01-18T19:37:26Z","timestamp":1358537846000},"page":"443-460","source":"Crossref","is-referenced-by-count":50,"title":["Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems"],"prefix":"10.1007","volume":"69","author":[{"given":"M. Reza","family":"Khani","sequence":"first","affiliation":[]},{"given":"Mohammad R.","family":"Salavatipour","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,19]]},"reference":[{"key":"9740_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","volume":"59","author":"E.M. 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). doi: 10.1016\/j.jalgor.2005.01.007","journal-title":"J. Algorithms"},{"key":"9740_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.1070.0209","volume":"42","author":"A.M. 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":"9740_CR3","first-page":"36","volume-title":"IEEE Symposium on Foundations of Computer Science","author":"K. Chaudhuri","year":"2003","unstructured":"Chaudhuri, K., Godfrey, B., Rao, S., Talwar, K.: Paths, trees, and minimum latency tours. In: IEEE Symposium on Foundations of Computer Science, pp. 36\u201345 (2003)"},{"key":"9740_CR4","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-540-27821-4_7","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Kumar, A.: Maximum coverage problem with group budget constraints and applications. In: Approximation Algorithms for Combinatorial Optimization, pp. 72\u201383 (2004)"},{"issue":"4","key":"9740_CR5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G. Even","year":"2004","unstructured":"Even, G., Garg, N., Konemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32(4), 309\u2013315 (2004)","journal-title":"Oper. Res. Lett."},{"key":"9740_CR6","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput. 7, 178\u2013193 (1978). doi: 10.1137\/0207017","journal-title":"SIAM J. Comput."},{"key":"9740_CR7","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1006\/jagm.1996.0848","volume":"24","author":"N. Guttmann-Beck","year":"1997","unstructured":"Guttmann-Beck, N., Hassin, R.: Approximation algorithms for min-max tree partition. J. Algorithms 24, 266\u2013286 (1997). doi: 10.1006\/jagm.1996.0848","journal-title":"J. Algorithms"},{"key":"9740_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.jda.2006.03.023","volume":"5","author":"R. Jothi","year":"2007","unstructured":"Jothi, R., Raghavachari, B.: Approximating the k-traveling repairman problem with repair times. J.\u00a0Discrete Algorithms 5, 293\u2013303 (2007). doi: 10.1016\/j.jda.2006.03.023","journal-title":"J.\u00a0Discrete Algorithms"},{"key":"9740_CR9","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1287\/opre.40.4.790","volume":"40","author":"C.-L. Li","year":"1992","unstructured":"Li, C.-L., Simchi-Levi, D., Desrochers, M.: On the distance constrained vehicle routing problem. Oper. Res. 40, 790\u2013799 (1992)","journal-title":"Oper. Res."},{"key":"9740_CR10","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1093\/ietfec\/e88-a.5.1335","volume":"E88-A","author":"H. Nagamochi","year":"2005","unstructured":"Nagamochi, H.: Approximating the minmax rooted-subtree cover problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E88-A, 1335\u20131338 (2005)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"2","key":"9740_CR11","doi-asserted-by":"crossref","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":"9740_CR12","doi-asserted-by":"crossref","unstructured":"Xu, Z., Xu, L.: Approximation algorithms for min-max path cover problems with service handling time. Algorithms Comput. 383\u2013392 (2009)","DOI":"10.1007\/978-3-642-10631-6_40"},{"key":"9740_CR13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.orl.2010.02.004","volume":"38","author":"Z. Xu","year":"2010","unstructured":"Xu, Z., Wen, Q.: Approximation hardness of min-max tree covers. Oper. Res. Lett. 38, 169\u2013173 (2010). doi: 10.1016\/j.orl.2010.02.004","journal-title":"Oper. Res. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9740-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9740-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9740-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,8]],"date-time":"2019-07-08T13:48:43Z","timestamp":1562593723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9740-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,19]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9740"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9740-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,19]]}}}