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 条

[21] Minimum Spanning Trees in Temporal Graphs
Huang, Silu
Fu, Ada Wai-Chee
Liu, Ruifeng
SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 419 - 430
[22] Minimum spanning trees and types of dissimilarities
Leclerc, B
EUROPEAN JOURNAL OF COMBINATORICS, 1996, 17 (2-3) : 255 - 264
[23] Finding minimum congestion spanning trees
Werneck, RFF
Setubal, JC
da Conceiçao, AF
ALGORITHM ENGINEERING, 1999, 1668 : 60 - 71
[24] Parametric and kinetic minimum spanning trees
Agarwal, PK
Eppstein, D
Guibas, LJ
Henzinger, MR
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 596 - 605
[25] Minimum spanning trees for community detection
Wu, Jianshe
Li, Xiaoxiao
Jiao, Licheng
Wang, Xiaohua
Sun, Bo
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2013, 392 (09) : 2265 - 2277
[26] CUMULATIVE CONSTRUCTION OF MINIMUM SPANNING TREES
ROGER, JH
CARPENTE.RG
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES C-APPLIED STATISTICS, 1971, 20 (02) : 192 - &
[27] Minimum Spanning Trees with Sums of Ratios
Christopher C. Skiscim
Susan W. Palocsay
Journal of Global Optimization, 2001, 19 : 103 - 120
[28] Distributed verification of minimum spanning trees
Amos Korman
Shay Kutten
Distributed Computing, 2007, 20 : 253 - 266
[29] On minimum edge ranking spanning trees
Makino, K
Uno, Y
Ibaraki, T
JOURNAL OF ALGORITHMS, 2001, 38 (02) : 411 - 437
[30] Minimum restricted diameter spanning trees
Hassin, R
Levin, A
APPROXIMATION ALGORITHMS FOR COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2002, 2462 : 175 - 184

← 1 2 3 4 5 →