Frontiers in Algorithmics and Algorithmic Aspects in Information and Management pp 153-162 | Cite as
Spanning Distribution Trees of Graphs
Abstract
Let G be a graph with a single source w, assigned a positive integer called the supply. Every vertex other than w is a sink, assigned a nonnegative integer called the demand. Every edge is assigned a positive integer called the capacity. Then a spanning tree T of G is called a spanning distribution tree if the capacity constraint holds when, for every sink v, an amount of flow, equal to the demand of v, is sent from w to v along the path in T between them. The spanning distribution tree problem asks whether a given graph has a spanning distribution tree or not. In the paper, we first observe that the problem is NP-complete even for series-parallel graphs, and then give a pseudo-polynomial time algorithm to solve the problem for a given series-parallel graph G.
Keywords
spanning distribution tree series-parallel graph flow supply demand partial k-treePreview
Unable to display preview. Download preview PDF.
References
- 1.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)CrossRefGoogle Scholar
- 2.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-RANDOM 2009. LNCS, vol. 5687, pp. 42–55. Springer, Heidelberg (2009)CrossRefGoogle Scholar
- 3.Dinitz, Y., Garg, N., Goemans, M.X.: On the single-source unsplittable flow problem. Combinatorica 19(1), 17–41 (1999)MathSciNetMATHCrossRefGoogle Scholar
- 4.Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness (Twenty-second printing), pp. 90–91. W.H. Freeman and Company (2000)Google Scholar
- 5.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)MathSciNetMATHCrossRefGoogle Scholar
- 6.Ito, T., Zhou, X., Nishizeki, T.: Partitioning graphs of supply and demand. Discrete Applied Math. 157, 2620–2633 (2009)MathSciNetMATHCrossRefGoogle Scholar
- 7.Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. IJFCS 16(4), 803–827 (2005)MathSciNetMATHGoogle Scholar
- 8.Kawabata, M., Nishizeki, T.: Partitioning trees with supply, demand and edge-capacity. In: Proc. of ISORA 2011. Lecture Notes in Operation Research, vol. 14, pp. 51–58 (2011); Also IEICE Trans. on Fundamentals of Electronics, Communications and Computer Science (to appear)Google Scholar
- 9.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)Google Scholar
- 10.Kleinberg, J.M.: Single-source unsplittable flow. In: Proc. of 37th FOCS, pp. 68–77 (1996)Google Scholar
- 11.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)CrossRefGoogle Scholar
- 12.Nishizeki, T., Vygen, J., Zhou, X.: The edge-disjoint paths problem is NP-complete for series-parallel graphs. Discrete Applied Math. 115, 177–186 (2001)MathSciNetMATHCrossRefGoogle Scholar
- 13.Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach. 29, 623–641 (1982)MathSciNetMATHCrossRefGoogle Scholar
- 14.Teng, J.-H., Lu, C.-N.: Feeder-switch relocation for customer interruption cost minimization. IEEE Trans. on Power Delivery 17(1), 254–259 (2002)CrossRefGoogle Scholar