Abstract
Given an edge-weighted digraph G with a designated vertex r, and a vertex capacity δ, we consider the problem of finding a shortest path tree T rooted at r such that for each vertex v the number of children of v in T does not exceed the capacity δ(v). The problem has an application in designing a routing for transferring files from the source node to other nodes in an information network. In this paper, we first present an efficient algorithm to the problem. We then introduce extensions of the problem by relaxing the degree constraint or the distance constraint in various ways and show polynomial algorithms or the computational hardness of these problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
H.-A. Choi and S. L. Hakimi, Scheduling File Transfers For Trees and Odd Cycles, SIAM J. Comput., Vol. 16, No. 1, pp. 162–168, 1987.
H.-A. Choi and S. L. Hakimi, Data Transfers in Networks with Transceivers, Networks, Vol. 17, pp. 393–421, 1987.
H.-A. Choi and S. L. Hakimi, Data Transfers in Networks, Algorithmica, Vol. 3, 223–245, 1988.
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–780, 1985.
E. W. Dijkstra, A Note on Two Problems in Connexion with Graphs, Numerische Mathematik, Vol. 1, pp. 269–271, 1959.
S. Even and R. E. Tarjan, Network Flow and Testing Graph Connectivity, SIAM J. Comput., pp. 507–518, 1975.
M. L. Fredman and R. E. Tarjan, Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, J. ACM, Vol. 34, pp. 596–615, 1987.
M. Fürer 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–324, 1992.
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–122, 1986.
M. Garey and D. Johnson, Computers and Intractability, W. H. Freeman and Company, San Francisco, 1978.
D. S. Hochbaum, Approximation Algorithms form NP-Hard Problems, PWS Publishing Company, Boston, 1997.
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–386, 1993.
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–528, 1995.
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–679, 1995.
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–904, 1992.
M. Klein, A Primal Method for Minimal Cost Flows, Management Science, Vol. 14, pp. 205–220, 1967.
J. Plesnik, The Complexity of Designing a Network with Minimum Diameter, Networks, Vol. 11, pp. 77–85, 1981.
P. I. Rivera-Vega, R. Varadarajan and S. B. Navathe, Scheduling File Transfers in Fully Connected Networks, Networks, Vol. 22, pp. 563–588, 1992.
D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.
J. Whitehead, The Complexity Of File Transfer Scheduling with Forwarding, SIAM J. Comput., Vol. 19, No. 2, pp. 222–245, 1990.
J. Whitney, On The Abstract Properties of Liner Dependence, American Journal of Mathematics., Vol. 57, pp. 509–533, 1935.
T. Yamagata, A. Fujii, and Y. Nemoto, A Multicast Routing Algorithm, IEICE Trans., Vol. J80-D-I, No. 9, pp. 739–744, 1997. (in Japanese)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ito, H., Nagamochi, H., Sugiyama, Y., Fujita, M. (2002). File Transfer Tree Problems. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_39
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive