An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees' Weights in a Given Range

An Efficient Algorithm for Node-Weighted Tree Partitioning with Subtrees' Weights in a Given Range

Tree partitioning arises in many parallel and distributed computing applications and storage systems. Some operator scheduling problems need to partition a tree into a number of vertex-disjoint subtrees such that some constraints are satisfied and some criteria are optimized. Given a tree T with eac...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE transactions on information and systems 2013, Vol.E96.D (2), p.270-277
Hauptverfasser: Luo, Guangchun, Chen, Hao, Qu, Caihui, Liu, Yuhai, Qin, Ke
Format: Artikel
Sprache:jpn
Schlagworte:
Algorithms
Criteria
Integers
Operators
Partitioning
Scheduling
Storage systems
Trees
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Tree partitioning arises in many parallel and distributed computing applications and storage systems. Some operator scheduling problems need to partition a tree into a number of vertex-disjoint subtrees such that some constraints are satisfied and some criteria are optimized. Given a tree T with each vertex or node assigned a nonnegative integer weight, two nonnegative integers l and u (l
ISSN:0916-8532
1745-1361
DOI:10.1587/transinf.E96.D.270