Partitioning trees of supply and demand

Takehiro Ito, Xiao Zhou, Takao Nishizeki

研究成果: Conference contribution

7 被引用数 (Scopus)

抄録

Assume that a tree T has a number ns of "supply vertices" and all the other vertices are "demand vertices." Each supply vertex is assigned a positive number called a supply, while each demand vertex is assigned a positive number called a demand. One wish to partition T into exactly ns subtrees by deleting edges from T so that each subtree contains exactly one supply vertex whose supply is no less than the sum of demands of all demand vertices in the subtree. The "partition problem" is a decision problem to ask whether T has such a partition. The "maximum partition problem" is an optimization version of the partition problem. In this paper, we give three algorithms for the problems. First is a linear-time algorithm for the partition problem. Second is a pseudo-polynomial-time algorithm for the maximum partition problem. Third is a fully polynomial-time approximation scheme (FPTAS) for the maximum partition problem.

本文言語English
ホスト出版物のタイトルAlgorithms and Computation - 13th International Symposium, ISAAC 2002, Proceedings
ページ612-623
ページ数12
DOI
出版ステータスPublished - 2002
イベント13th Annual International Symposium on Algorithms and Computation, ISAAC 2002 - Vancouver, BC, Canada
継続期間: 2002 11 212002 11 23

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2518 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other13th Annual International Symposium on Algorithms and Computation, ISAAC 2002
国/地域Canada
CityVancouver, BC
Period02/11/2102/11/23

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Partitioning trees of supply and demand」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル