Balanced partition of minimum spanning trees

被引：0
|
作者：
Andersson, M
Gudmundsson, J
Levcopoulos, C
Narasimhan, G
机构：
[1] Lund Univ, Dept Comp Sci, S-22100 Lund, Sweden
[2] Univ Utrecht, Dept Comp Sci, NL-3508 TB Utrecht, Netherlands
[3] Florida Int Univ, Sch Comp Sci, Miami, FL 33199 USA
来源：
COMPUTATIONAL SCIENCE-ICCS 2002, PT III, PROCEEDINGS | 2002年 / 2331卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
To better handle situations where additional resources are available to carry out a task, many problems from the manufacturing industry involve "optimally" dividing a task into k smaller tasks. We consider the problem of partitioning a given set S of n points (in the plane) into k subsets, S-1, . . .,S-k, such that max(1less than or equal toiless than or equal tok)\MST(S-i)\ is minimized. A variant of this problem arises in the shipbuilding industry [2].
引用
收藏
页码：26 / 35
页数：10
相关论文
共 50 条
12345