{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:36:07Z","timestamp":1725525367105},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002014"},{"type":"electronic","value":"9783642002021"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00202-1_18","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T02:34:01Z","timestamp":1234233241000},"page":"202-213","source":"Crossref","is-referenced-by-count":1,"title":["Minmax Tree Cover in the Euclidean Space"],"prefix":"10.1007","author":[{"given":"Seigo","family":"Karakawa","sequence":"first","affiliation":[]},{"given":"Ehab","family":"Morsy","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1142\/S0218195903001190","volume":"13","author":"M. Andersson","year":"2003","unstructured":"Andersson, M., Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Balanced partition of minimum spanning trees. International Journal of Computational Geometry and Applications\u00a013, 303\u2013316 (2003)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0166-218X(95)00054-U","volume":"68","author":"I. Averbakh","year":"1996","unstructured":"Averbakh, I., Berman, O.: A heuristic with worst-case analysis for minmax routing of two traveling salesman on a tree. Discrete Applied Mathematics\u00a068, 17\u201332 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0166-218X(97)89161-5","volume":"75","author":"I. Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: (p\u2009\u2212\u20091)\/(p\u2009+\u20091)-approximate algorithm for p-traveling salesman problems on a tree with minmax objective. Discrete Applied Mathematics\u00a075, 201\u2013216 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/S0377-2217(01)00380-0","volume":"144","author":"B. Bozkaya","year":"2003","unstructured":"Bozkaya, B., Erkut, E., Laporte, G.: A tabu search heuristics and adaptive memory procedure for political districting. European J. Operation Research\u00a0144, 12\u201326 (2003)","journal-title":"European J. Operation Research"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1137\/0207031","volume":"7","author":"J. Bruno","year":"1978","unstructured":"Bruno, J., Downey, P.: Complexity of task sequencing with deadlines, set-up times and changeover costs. SIAM J. Comput.\u00a07, 393\u2013581 (1978)","journal-title":"SIAM J. Comput."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0166-218X(03)00340-8","volume":"134","author":"R. Cordone","year":"2004","unstructured":"Cordone, R., Maffioli, F.: On the complexity of graph tree partition problems. Discrete Applied Mathematics\u00a0134, 51\u201365 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR7","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., K\u00f6nemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Operations Research Letters\u00a032, 309\u2013315 (2004)","journal-title":"Operations Research Letters"},{"key":"18_CR8","unstructured":"Karakawa, S., Morsy, E., Nagamochi, H.: Minmax Tree Cover in the Euclidean Space. Technical Report, 2008-013, Discrete Mathematics Lab., Graduate School of Informatics, Kyoto University, \n \n http:\/\/www.amp.i.kyoto-u.ac.jp\/tecrep\/TR2008.html"},{"key":"18_CR9","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 on a path with release and handling times. Discrete Applied Mathematics\u00a0129, 433\u2013447 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR10","first-page":"527","volume":"1","author":"Y. Karuno","year":"2005","unstructured":"Karuno, Y., Nagamochi, H.: Scheduling vehicles on trees. Pacific J. Optim.\u00a01, 527\u2013543 (2005)","journal-title":"Pacific J. Optim."},{"volume-title":"Handbook of Approximation Algorithms and Metaheuristics","year":"2007","author":"Y. Karuno","key":"18_CR11","unstructured":"Karuno, Y., Nagamochi, H.: Vehicle scheduling problems in graphs. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, ch.\u00a046. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Nagamochi, H.: Approximating the minmax rooted-subtree cover problem. IEICE Trans. Fundamentals E88-A(5), 1335\u20131338 (2005)","DOI":"10.1093\/ietfec\/e88-a.5.1335"},{"issue":"8","key":"18_CR13","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.dam.2005.10.013","volume":"154","author":"H. Nagamochi","year":"2006","unstructured":"Nagamochi, H., Kawada, T.: Minmax subtree cover problem on cacti. Discrete Applied Mathematics\u00a0154(8), 1254\u20131263 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR14","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.\u00a02906, pp. 138\u2013147. Springer, Heidelberg (2003)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.dam.2003.06.001","volume":"140","author":"H. Nagamochi","year":"2004","unstructured":"Nagamochi, H., Okada, K.: A faster 2-approximation algorithm for the minmax p-traveling salesman problem on a tree. Discrete Applied Mathematics\u00a0140, 103\u2013114 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR16","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\u00a0104, 173\u20131178 (2007)","journal-title":"Information Processing Letters"},{"key":"18_CR17","first-page":"12","volume":"74","author":"J.C. Williams Jr.","year":"1985","unstructured":"Williams Jr., J.C.: Political districting: a review. Papers in Regional Science\u00a074, 12\u201340 (1985)","journal-title":"Papers in Regional Science"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00202-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T07:42:07Z","timestamp":1551771727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00202-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002014","9783642002021"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-00202-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}
