{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:24Z","timestamp":1725516804335},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_44","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"444-457","source":"Crossref","is-referenced-by-count":1,"title":["Covering Directed Graphs by In-Trees"],"prefix":"10.1007","author":[{"given":"Naoyuki","family":"Kamiyama","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"44_CR1","doi-asserted-by":"publisher","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\u00a059(1), 1\u201318 (2006)","journal-title":"J. Algorithms"},{"issue":"4","key":"44_CR2","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. Oper. Res. Lett.\u00a032(4), 309\u2013315 (2004)","journal-title":"Oper. Res. Lett."},{"key":"44_CR3","first-page":"77","volume":"41","author":"A. Frank","year":"1979","unstructured":"Frank, A.: Covering branchings. Acta Scientiarum Mathematicarum [Szeged]\u00a041, 77\u201381 (1979)","journal-title":"Acta Scientiarum Mathematicarum [Szeged]"},{"issue":"4","key":"44_CR4","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0196-6774(81)90032-8","volume":"2","author":"A. Frank","year":"1981","unstructured":"Frank, A.: A weighted matroid intersection algorithm. J. Algorithms\u00a02(4), 328\u2013336 (1981)","journal-title":"J. Algorithms"},{"key":"44_CR5","unstructured":"Frank, A.: Rooted k-connections in digraphs. Discrete Applied Mathematics (to appear)"},{"issue":"4","key":"44_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                  5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"44_CR7","unstructured":"Jordan, T.: Two NP-complete augmentation problems. Technical Report\u00a08, Department of Mathematics and Computer Science, Odense University (1997)"},{"key":"44_CR8","unstructured":"Kamiyama, N., Katoh, N., Takizawa, A.: Arc-disjoint in-trees in directed graphs. In: Proc. the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 518\u2013526 (2008)"},{"key":"44_CR9","unstructured":"Knuth, D.: Matroid partitioning. Technical Report STAN-CS-73-342, Computer Science Department, Stanford University (1974)"},{"issue":"5","key":"44_CR10","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. Inf. Process. Lett.\u00a0104(5), 173\u2013178 (2007)","journal-title":"Inf. Process. Lett."},{"key":"44_CR11","volume-title":"Matroid theory","author":"J.G. Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid theory. Oxford University Press, Oxford (1992)"},{"key":"44_CR12","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0012-365X(78)90174-7","volume":"24","author":"K. Vidyasankar","year":"1978","unstructured":"Vidyasankar, K.: Covering the edge set of a directed graph with trees. Discrete Mathematics\u00a024, 79\u201385 (1978)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:44:54Z","timestamp":1620002694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}