{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:36:55Z","timestamp":1725521815336},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001423"},{"type":"electronic","value":"9783540361367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36136-7_39","type":"book-chapter","created":{"date-parts":[[2008,11,25]],"date-time":"2008-11-25T14:07:11Z","timestamp":1227622031000},"page":"441-452","source":"Crossref","is-referenced-by-count":2,"title":["File Transfer Tree Problems"],"prefix":"10.1007","author":[{"given":"Hiro","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yosuke","family":"Sugiyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masato","family":"Fujita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1137\/0216013","volume":"16","author":"H.-A. Choi","year":"1987","unstructured":"H.-A. Choi and S. L. Hakimi, Scheduling File Transfers For Trees and Odd Cycles, SIAM J. Comput., Vol. 16, No. 1, pp. 162\u2013168, 1987.","journal-title":"SIAM J. Comput."},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230170404","volume":"17","author":"H.-A. Choi","year":"1987","unstructured":"H.-A. Choi and S. L. Hakimi, Data Transfers in Networks with Transceivers, Networks, Vol. 17, pp. 393\u2013421, 1987.","journal-title":"Networks"},{"key":"39_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01762116","volume":"3","author":"H.-A. Choi","year":"1988","unstructured":"H.-A. Choi and S. L. Hakimi, Data Transfers in Networks, Algorithmica, Vol. 3, 223\u2013245, 1988.","journal-title":"Algorithmica"},{"issue":"3","key":"39_CR4","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E. G. Coffman Jr","year":"1985","unstructured":"E. G. Coffman. Jr, M. R. Garey, D. S. Johnson and A. S. Lapaugh, Scheduling File Transfers, SIAM J. Comput., Vol. 14, No. 3, pp. 744\u2013780, 1985.","journal-title":"SIAM J. Comput."},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra, A Note on Two Problems in Connexion with Graphs, Numerische Mathematik, Vol. 1, pp. 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"S. Even and R. E. Tarjan, Network Flow and Testing Graph Connectivity, SIAM J. Comput., pp. 507\u2013518, 1975.","DOI":"10.1137\/0204043"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan, Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, J. ACM, Vol. 34, pp. 596\u2013615, 1987.","journal-title":"J. ACM"},{"key":"39_CR8","unstructured":"M. F\u00fcrer and B. Raghavachari, Approximating The Minimum Degree Spanning Tree to within One from The Optimal Degree, 3rd ACM-SIAM Symp. on Disc. Algorithms, pp. 317\u2013324, 1992."},{"key":"39_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF02579168","volume":"6","author":"H. N. Gabow","year":"1986","unstructured":"H. N. Gabow, Z. Galil, T. Spencer, and R. E. Tarjan, Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs, Combinatorica, Vol. 6, pp. 109\u2013122, 1986.","journal-title":"Combinatorica"},{"key":"39_CR10","volume-title":"Computers and Intractability","author":"M. Garey","year":"1978","unstructured":"M. Garey and D. Johnson, Computers and Intractability, W. H. Freeman and Company, San Francisco, 1978."},{"key":"39_CR11","volume-title":"Approximation Algorithms form NP-Hard Problems","author":"D. S. Hochbaum","year":"1997","unstructured":"D. S. Hochbaum, Approximation Algorithms form NP-Hard Problems, PWS Publishing Company, Boston, 1997."},{"issue":"3","key":"39_CR12","first-page":"377","volume":"E76-A","author":"Y. Kaneko","year":"1993","unstructured":"Y. Kaneko, S. Shinoda and K. Horiuchi, A Synthesis of an Optimal File Transfer on a File Transmission Net, IEICE Trans. Fundamentals, Vol. E76-A, No. 3, pp. 377\u2013386, 1993.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"4","key":"39_CR13","first-page":"517","volume":"E78-A","author":"Y. Kaneko","year":"1995","unstructured":"Y. Kaneko, S. Shinoda and K. Horiuchi, On an Optimal File Transfer on an Arborescence-Net with Constraints on Copying Numbers, IEICE Trans. Fundamentals, Vol. E78-A, No. 4, pp. 517\u2013528, 1995.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"6","key":"39_CR14","first-page":"671","volume":"E78-A","author":"Y. Kaneko","year":"1995","unstructured":"Y. Kaneko, K. Suzuki, S. Shinoda and K. Horiuchi, A Synthesis of a Forest-Type Optimal File Transfer on a File Transmission Net with Source Vertices, IEICE Trans. Fundamentals, Vol. E78-A, No. 6, pp. 671\u2013679, 1995.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"7","key":"39_CR15","first-page":"901","volume":"E75-A","author":"Y. Kaneko","year":"1992","unstructured":"Y. Kaneko, R. Tashiro, S. Shinoda and K. Horiuchi, A Liner-Time Algorithm for Designing an Optimal File Transfer Through an Arborescence-Net, IEICE Trans. Fundamentals, Vol. E75-A, No. 7, pp. 901\u2013904, 1992.","journal-title":"IEICE Trans. Fundamentals"},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","volume":"14","author":"M. Klein","year":"1967","unstructured":"M. Klein, A Primal Method for Minimal Cost Flows, Management Science, Vol. 14, pp. 205\u2013220, 1967.","journal-title":"Management Science"},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/net.3230110110","volume":"11","author":"J. Plesnik","year":"1981","unstructured":"J. Plesnik, The Complexity of Designing a Network with Minimum Diameter, Networks, Vol. 11, pp. 77\u201385, 1981.","journal-title":"Networks"},{"key":"39_CR18","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1002\/net.3230220606","volume":"22","author":"P. I. Rivera-Vega","year":"1992","unstructured":"P. I. Rivera-Vega, R. Varadarajan and S. B. Navathe, Scheduling File Transfers in Fully Connected Networks, Networks, Vol. 22, pp. 563\u2013588, 1992.","journal-title":"Networks"},{"key":"39_CR19","volume-title":"Matroid Theory","author":"D. J. A. Welsh","year":"1976","unstructured":"D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976."},{"key":"39_CR20","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1137\/0219015","volume":"19","author":"J. Whitehead","year":"1990","unstructured":"J. Whitehead, The Complexity Of File Transfer Scheduling with Forwarding, SIAM J. Comput., Vol. 19, No. 2, pp. 222\u2013245, 1990.","journal-title":"SIAM J. Comput."},{"key":"39_CR21","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"J. Whitney","year":"1935","unstructured":"J. Whitney, On The Abstract Properties of Liner Dependence, American Journal of Mathematics., Vol. 57, pp. 509\u2013533, 1935.","journal-title":"American Journal of Mathematics"},{"issue":"9","key":"39_CR22","first-page":"739","volume":"J80-D-I","author":"T. Yamagata","year":"1997","unstructured":"T. Yamagata, A. Fujii, and Y. Nemoto, A Multicast Routing Algorithm, IEICE Trans., Vol. J80-D-I, No. 9, pp. 739\u2013744, 1997. (in Japanese)","journal-title":"IEICE Trans."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36136-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:05:56Z","timestamp":1551063956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36136-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001423","9783540361367"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36136-7_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}