Abstract
Assume that a graph G has l sources, each assigned a non-negative integer called a supply, that all the vertices other than the sources are sinks, each assigned a non-negative integer called a demand, and that each edge of G is assigned a non-negative integer, called a capacity. Then one wishes to find a spanning forest F of G such that F consists of l trees, each tree T in F contains a source w, and the flow through each edge of T does not exceed the edge-capacity when a flow of an amount equal to a demand is sent from w to each sink in T along the path in T. Such a forest F is called a spanning distribution forest of G. In the paper, we first present a pseudo-polynomial time algorithm to find a spanning distribution forest of a given series-parallel graph, and then extend the algorithm for graphs with bounded tree-width.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Boulaxis, N.G., Papadopoulos, M.P.: Optimal feeder routing in distribution system planning using dynamic programming technique and GIS facilities. IEEE Trans. on Power Delivery 17(1), 242–247 (2002)
Chekuri, C., Ene, A., Korula, N.: Unsplittable flow in paths and trees and column-restricted packing integer programs. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol. 5687, pp. 42–55. Springer, Heidelberg (2009)
Dinitz, Y., Garg, N., Goemans, M.X.: On the single-source unsplittable flow problem. Combinatorica 19(1), 17–41 (1999)
Ito, T., Demaine, E.D., Zhou, X., Nishizeki, T.: Approximability of partitioning graphs with supply and demand. Journal of Discrete Algorithms 6, 627–650 (2008)
Ito, T., Zhou, X., Nishizeki, T.: Partitioning graphs of supply and demand. Discrete Applied Math. 157, 2620–2633 (2009)
Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. IJFCS 16(4), 803–827 (2005)
Kawabata, M., Nishizeki, T.: Partitioning trees with supply, demand and edge-capacity. IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science 96-A(6), 1036–1043 (2013)
Kawabata, M., Nishizeki, T.: Spanning distribution trees of graphs. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol. 7924, pp. 153–162. Springer, Heidelberg (2013); also IEICE Trans. E97-D(3) (2014)
Kim, M.S., Lam, S.S., Lee, D.-Y.: Optimal distribution tree for internet streaming media. In: Proc. 23rd Int. Conf. on Distributed Computing System (ICDCS 2003), pp. 116–125 (2003)
Kleinberg, J.M.: Single-source unsplittable flow. In: Proc. of 37th FOCS, pp. 68–77 (1996)
Morton, A.B., Mareels, I.M.Y.: An efficient brute-force solution to the network reconfiguration problem. IEEE Trans. on Power Delivery 15(3), 996–1000 (2000)
Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach. 29, 623–641 (1982)
Teng, J.-H., Lu, C.-N.: Feeder-switch relocation for customer interruption cost minimization. IEEE Trans. on Power Delivery 17(1), 254–259 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Inoue, K., Nishizeki, T. (2014). Spanning Distribution Forests of Graphs. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_11
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)