THE MAXIMUM COVERAGE LOCATION PROBLEM

被引：139

作者：

MEGIDDO, N

ZEMEL, E

HAKIMI, SL

机构：

[1] NORTHWESTERN UNIV,JL KELLOGG GRAD SCH MANAGEMENT,EVANSTON,IL 60201

[2] NORTHWESTERN UNIV,DEPT ELECT ENGN & COMP SCI,EVANSTON,IL 60201

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1983年 / 4卷 / 02期

关键词：

D O I：

10.1137/0604028

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：253 / 261

页数：9

共 11 条

[1] CHANDRASEKARAN R, 1979, LOCATING OBNOXIOUS F
[2] CHURCH RL, 1978, TRANSPORT SCI, V1, P107
[3] FREDERICKSON GN, 1979, 13TH P C INF SCI SYS, P47
[4] FAST SELECTION ALGORITHM AND THE PROBLEM OF OPTIMUM DISTRIBUTION OF EFFORT
GALIL, Z
MEGIDDO, N
[J]. JOURNAL OF THE ACM, 1979, 26 (01) : 58 - 64
[5] Garey Michael R., 1979, COMPUTERS INTRACTABI
[6] GILES R, 1978, ARS COMBINATORIA, V6, P179
[7] OPTIMUM LOCATIONS OF SWITCHING CENTERS + ABSOLUTE CENTERS + MEDIANS OF GRAPH
HAKIMI, SL
[J]. OPERATIONS RESEARCH, 1964, 12 (03) : 450 - &
[8] HAKIMI SL, 1981, JUN ISOLDEII SKODSB
[9] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .2. P-MEDIANS
KARIV, O
HAKIMI, SL
[J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1979, 37 (03) : 539 - 560
[10] KOLEN A, 1981, JUN ISOLDEII SKODSB