THE MAXIMUM COVERAGE LOCATION PROBLEM

被引：143

作者：

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

GALIL, Z ;

MEGIDDO, N .

[5]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[6]

GILES R, 1978, ARS COMBINATORIA, V6, P179

HAKIMI, SL .

[8]

HAKIMI SL, 1981, JUN ISOLDEII SKODSB

[9] ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS .2. P-MEDIANS [J].

KARIV, O ;

HAKIMI, SL .

[10]

KOLEN A, 1981, JUN ISOLDEII SKODSB