Abstract
Let T be a given tree. Each vertex of T is either a supply vertex or a demand vertex, and is assigned a positive integer, called the supply or the demand. Every demand vertex v of T must be supplied an amount of “power,” equal to the demand of v, from exactly one supply vertex through edges in T. Each edge e of T has a direction, and is assigned a positive integer which represents the cost required to delete e from T or reverse the direction of e. Then one wishes to obtain subtrees of T by deleting edges or reversing the directions of edges so that (a) each subtree contains exactly one supply vertex whose supply is no less than the sum of all demands in the subtree and (b) every edge is directed away from the supply vertex in each subtree. One wishes to minimize the total cost to obtain such subtrees from T. In the paper, we first show that this minimization problem is NP-hard, and then give a pseudo-polynomial-time algorithm to solve the problem. We finally give a fully polynomial-time approximation scheme (FPTAS) for the problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boulaxis, N.G., Papadopoulos, M.P.: Optimal feeder routing in distribution system planning using dynamic programming technique and GIS facilities. IEEE Trans. Power Deliv., 17, 242–247 (2002)
Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 35, 713–728 (2005)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Ibarra, O.H., Kim, C.E.: Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22, 463–468 (1975)
Ito, T., Demaine, E.D., Zhou, X., Nishizeki, T.: Approximability of partitioning graphs with supply and demand. J. Discrete Algorithms, 6, 627–650 (2008)
Ito, T., Hara, T., Zhou, X., Nishizeki, T.: Minimum cost partitions of trees with supply and demand. In: Proc. of the 21st Annual International Symposium on Algorithms and Computation (ISAAC 2010) Part II. Lecture Notes in Computer Science, vol. 6507, pp. 351–362. Springer, Berlin (2010)
Ito, T., Zhou, X., Nishizeki, T.: Partitioning trees of supply and demand. Int. J. Found. Comput. Sci., 16, 803–827 (2005)
Ito, T., Zhou, X., Nishizeki, T.: Partitioning graphs of supply and demand. Discrete Appl. Math. 157, 2620–2633 (2009)
Jansen, K.: Parameterized approximation scheme for the multiple knapsack problem. In: Proc. of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 665–674. Springer, Berlin (2009)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)
Morton, A.B., Mareels, I.M.Y.: An efficient brute-force solution to the network reconfiguration problem. IEEE Trans. Power Deliv., 15, 996–1000 (2000)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
Teng, J.-H., Lu, C.-N.: Feeder-switch relocation for customer interruption cost minimization. IEEE Trans. Power Deliv., 17, 254–259 (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ito, T., Hara, T., Zhou, X. et al. Minimum Cost Partitions of Trees with Supply and Demand. Algorithmica 64, 400–415 (2012). https://doi.org/10.1007/s00453-011-9573-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-011-9573-7