{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:06Z","timestamp":1725559146183},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_61","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"705-716","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the Minmax Subtree Cover Problem in a Cactus"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Nagamochi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taizo","family":"Kawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011461300596","volume":"5","author":"T. Asano","year":"2001","unstructured":"Asano, T., Katoh, N., Kawashima, K.: A new approximation algorithm for the capacitated vehicle routing problem on a tree. J. Combinatorial Optimization\u00a05, 213\u2013231 (2001)","journal-title":"J. Combinatorial Optimization"},{"key":"61_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.3230250204","volume":"25","author":"I. Averbakh","year":"1995","unstructured":"Averbakh, I., Berman, O.: Sales-delivery man problems on treelike networks. Networks\u00a025, 45\u201358 (1995)","journal-title":"Networks"},{"key":"61_CR3","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 salesmen on a tree. Discrete Applied Mathematics\u00a068, 17\u201332 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"61_CR4","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)\u2013approximate algorithm for p\u2013traveling salesmen problems on a tree with minmax objective. Discrete Applied Mathematics\u00a075, 201\u2013216 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"61_CR5","first-page":"35","volume-title":"Handbooks in Operations Research and Management Science, Network Routing","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time constrained routing and scheduling. In: Ball, M.O., Magnanti, T.L. (eds.) Handbooks in Operations Research and Management Science, Network Routing, vol.\u00a08, pp. 35\u2013139. North-Holland, Amsterdam (1995)"},{"key":"61_CR6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.15807\/jorsj.39.345","volume":"39","author":"Y. Karuno","year":"1996","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: Vehicle scheduling on a tree to minimize maximum lateness. Journal of the Operations Research Society of Japan\u00a039, 345\u2013355 (1996)","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1018928911513","volume":"69","author":"Y. Karuno","year":"1997","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: Vehicle scheduling on a tree with release and handling times. Annals of Operations Research\u00a069, 193\u2013207 (1997)","journal-title":"Annals of Operations Research"},{"key":"61_CR8","unstructured":"Nagamochi, H.: Approximating the minmax rooted-subtree cover problem (submitted to a journal)"},{"key":"61_CR9","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\u2013traveling salesmen problem on a tree. Discrete Applied Mathematics\u00a0140, 103\u2013114 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"61_CR10","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":"61_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0166-218X(85)90041-1","volume":"12","author":"Y. Perl","year":"1985","unstructured":"Perl, Y., Vishkin, U.: Efficient implementation of a shifting algorithm, technique for the partitioning. Discrete Applied Mathematics\u00a012, 71\u201380 (1985)","journal-title":"Discrete Applied Mathematics"},{"key":"61_CR12","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/mnsc.36.2.212","volume":"36","author":"H. Psaraftis","year":"1990","unstructured":"Psaraftis, H., Solomon, M., Magnanti, T., Kim, T.: Routing and scheduling on a shoreline with release times. Management Science\u00a036, 212\u2013223 (1990)","journal-title":"Management Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_61.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:41Z","timestamp":1620012581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}