An O(m log n) algorithm for the max plus sum spanning tree problem

被引：9

作者：

Punnen, AP

Nair, KPK

机构：

[1] UNIV NEW BRUNSWICK,DEPT MATH STAT & COMP SCI,ST JOHN,NB E2L 4L5,CANADA

[2] UNIV NEW BRUNSWICK,FAC ADM,FREDERICTON,NB E3B 5A3,CANADA

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1996年 / 89卷 / 02期

基金：

加拿大自然科学与工程研究理事会;

关键词：

spanning tree; graph; algorithm; complexity;

D O I：

10.1016/0377-2217(94)00252-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In a graph in which each edge has two weights, the max + sum spanning tree problem seeks a spanning tree that has the minimum value for the combined total of the maximum of one of the edge weights and the sum of the other weights among all the spanning trees in the graph. Exploiting an efficient data structure, an O(m log n) algorithm is presented for solving this problem. This improves the currently known bound of O(mn).

引用

页码：423 / 426

页数：4

共 50 条

[1] AN O(LOG-M) PARALLEL ALGORITHM FOR THE MINIMUM SPANNING TREE PROBLEM
SURAWEERA, F
BHATTACHARYA, P
[J]. INFORMATION PROCESSING LETTERS, 1993, 45 (03) : 159 - 163
[2] An O(n(m plus n log n) log n) time algorithm to solve the minimum cost tension problem
Ghiyasvand, Mehdi
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2019, 37 (03) : 957 - 969
[3] AN O(N LOG N) MINIMAL SPANNING TREE ALGORITHM FOR N-POINTS IN THE PLANE
CHANG, RC
LEE, RCT
[J]. BIT, 1986, 26 (01): : 7 - 16
[4] AN O(N LOG M) ALGORITHM FOR THE JOSEPHUS PROBLEM
LLOYD, EL
[J]. JOURNAL OF ALGORITHMS, 1983, 4 (03) : 262 - 270
[5] An O(log k)-approximation algorithm for the k minimum spanning tree problem in the plane
Garg, N
Hochbaum, DS
[J]. ALGORITHMICA, 1997, 18 (01) : 111 - 121
[6] Inverse Max plus Sum spanning tree problem by modifying the sum-cost vector under weighted l∞Norm
Guan, Xiucui
Pardalos, Panos M.
Zuo, Xia
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2015, 61 (01) : 165 - 182
[7] Inverse max plus sum spanning tree problem under weighted l∞ norm by modifying max-weight vector
Jia, Junhua
Guan, Xiucui
Zhang, Qiao
Qian, Xinqiang
Pardalos, Panos M.
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2022, 84 (03) : 715 - 738
[8] AN O(LOG-N) PARALLEL ALGORITHM FOR CONSTRUCTING A SPANNING TREE ON PERMUTATION GRAPHS
WANG, YL
CHEN, HC
LEE, CY
[J]. INFORMATION PROCESSING LETTERS, 1995, 56 (02) : 83 - 87
[9] Inverse max plus sum spanning tree problem under weighted l1 norm by modifying the sum-cost vector
Guan, Xiucui
Pardalos, Panos M.
Zhang, Binwu
[J]. OPTIMIZATION LETTERS, 2018, 12 (05) : 1065 - 1077
[10] O(N LOG N) ALGORITHM FOR RECTILINEAR MINIMAL SPANNING TREES
HWANG, FK
[J]. JOURNAL OF THE ACM, 1979, 26 (02) : 177 - 182

← 1 2 3 4 5 →