ALGORITHMS FOR FINDING P-CENTERS ON A WEIGHTED TREE (FOR RELATIVELY SMALL P)

被引：19

作者：

JEGER, M

KARIV, O

机构：

[1] TECHNION ISRAEL INST TECHNOL,DEPT COMP SCI,HAIFA,ISRAEL

[2] TEL AVIV UNIV,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL

来源：

NETWORKS | 1985年 / 15卷 / 03期

关键词：

D O I：

10.1002/net.3230150308

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：381 / 389

页数：9

相关论文

共 13 条

[1] A SHIFTING ALGORITHM FOR MIN-MAX TREE PARTITIONING
BECKER, RI
SCHACH, SR
PERL, Y
[J]. JOURNAL OF THE ACM, 1982, 29 (01) : 58 - 67
[2] AN O((N LOG P)2) ALGORITHM FOR THE CONTINUOUS P-CENTER PROBLEM ON A TREE
CHANDRASEKARAN, R
TAMIR, A
[J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1980, 1 (04): : 370 - 375
[3] 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
[4] FREDERICKSON GN, 1979, 13TH P C INF SCI SYS, P47
[5] FREDERICKSON GN, 1981, CS8117 PENNS STAT U
[6] OPTIMUM DISTRIBUTION OF SWITCHING CENTERS IN A COMMUNICATION NETWORK AND SOME RELATED GRAPH THEORETIC PROBLEMS
HAKIMI, SL
[J]. OPERATIONS RESEARCH, 1965, 13 (03) : 462 - &
[7] OPTIMUM LOCATIONS OF SWITCHING CENTERS + ABSOLUTE CENTERS + MEDIANS OF GRAPH
HAKIMI, SL
[J]. OPERATIONS RESEARCH, 1964, 12 (03) : 450 - &
[8] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .2. P-MEDIANS
KARIV, O
HAKIMI, SL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1979, 37 (03) : 539 - 560
[9] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .1. P-CENTERS
KARIV, O
HAKIMI, SL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1979, 37 (03) : 513 - 538
[10] AN O(N-LOG2-N) ALGORITHM FOR THE KTH-LONGEST PATH IN A TREE WITH APPLICATIONS TO LOCATION-PROBLEMS
MEGIDDO, N
TAMIR, A
ZEMEL, E
CHANDRASEKARAN, R
[J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 328 - 337