Minimum cost partitions of trees with supply and demand

Takehiro Ito, Takuya Hara, Xiao Zhou, Takao Nishizeki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)


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 and 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) each subtree is rooted at the supply vertex in a sense that every edge is directed away from the root. We wish to minimize the total cost to obtain such rooted 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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings
Number of pages12
EditionPART 2
Publication statusPublished - 2010
Event21st Annual International Symposium on Algorithms and Computations, ISAAC 2010 - Jeju Island, Korea, Republic of
Duration: 2010 Dec 152010 Dec 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6507 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other21st Annual International Symposium on Algorithms and Computations, ISAAC 2010
Country/TerritoryKorea, Republic of
CityJeju Island

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Minimum cost partitions of trees with supply and demand'. Together they form a unique fingerprint.

Cite this