AN O (n log n)-TIME ALGORITHM FOR THE k-CENTER PROBLEM IN TREES

被引：5

作者：

Wang, Haitao ^{[1
]}

Zhang, Jingru ^{[2
]}

机构：

[1] Utah State Univ, Dept Comp Sci, Logan, UT 84322 USA

[2] Cleveland State Univ, Dept Elect Engn & Comp Sci, Cleveland, OH 44115 USA

来源：

SIAM JOURNAL ON COMPUTING | 2021年 / 50卷 / 02期

关键词：

k-center; trees; algorithms; computational geometry; facility locations; OPTIMAL SLOPE SELECTION; P-CENTERS; COMPLEXITY; LINE;

D O I：

10.1137/18M1196522

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We consider a classical k-center problem in trees. Let T be a tree of n vertices such that every vertex has a nonnegative weight. The problem is to find k centers on the edges of T such that the maximum weighted distance from all vertices to their closest centers is minimized. Megiddo and Tamir [SIAM J. Comput., 12 (1983), pp. 751-758] gave an algorithm that can solve the problem in O(n log(2) n) time by using Cole's parametric search. Since then it has been open for over three decades whether the problem can be solved in O(n log n) time. In this paper, we present an O(n log n) time algorithm for the problem and thus settle the open problem affirmatively.

引用

页码：602 / 635

页数：34

共 31 条

[11] Cormode Graham., 2008, P 27 ACM SIGMOD SIGA, P191, DOI DOI 10.1145/1376916.1376944
[12] FREDERICKSON GN, 1991, LECT NOTES COMPUT SC, V519, P299
[13] FREDERICKSON GN, 1991, PROCEEDINGS OF THE SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P168
[14] FINDING KTH PATHS AND PARA-CENTERS BY GENERATING AND SEARCHING GOOD DATA-STRUCTURES
FREDERICKSON, GN
JOHNSON, DB
[J]. JOURNAL OF ALGORITHMS, 1983, 4 (01) : 61 - 80
[15] GENERALIZED SELECTION AND RANKING - SORTED MATRICES
FREDERICKSON, GN
JOHNSON, DB
[J]. SIAM JOURNAL ON COMPUTING, 1984, 13 (01) : 14 - 30
[16] Huang LX, 2017, PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P110
[17] Manufacturer Perceptions and Responses to Destructive Behaviors of Distributors
Jaw, Chyi
Lo, Jyue-Yu
Wang, Hai-Chuan
[J]. NTU MANAGEMENT REVIEW, 2016, 26 (03): : 185 - 214
[18] ALGORITHMS FOR FINDING P-CENTERS ON A WEIGHTED TREE (FOR RELATIVELY SMALL P)
JEGER, M
KARIV, O
[J]. NETWORKS, 1985, 15 (03) : 381 - 389
[19] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .1. P-CENTERS
KARIV, O
HAKIMI, SL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1979, 37 (03) : 513 - 538
[20] Some variations on constrained minimum enclosing circle problem
Karmakar, Arindam
Das, Sandip
Nandy, Subhas C.
Bhattacharya, Binay K.
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (02) : 176 - 190

← 1 2 3 4 →