A HEURISTIC FOR THE P-CENTER PROBLEM IN GRAPHS

被引：65

作者：

PLESNIK, J

机构：

来源：

DISCRETE APPLIED MATHEMATICS | 1987年 / 17卷 / 03期

关键词：

D O I：

10.1016/0166-218X(87)90029-1

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：263 / 268

页数：6

共 18 条

[1]

Christofides N., 1975, GRAPH THEORY ALGORIT

[2] THE P-CENTER PROBLEM - HEURISTIC AND OPTIMAL-ALGORITHMS [J].

DREZNER, Z .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1984, 35 (08) :741-748

[3] A SIMPLE HEURISTIC FOR THE P-CENTER PROBLEM [J].

DYER, ME ;

FRIEZE, AM .

OPERATIONS RESEARCH LETTERS, 1985, 3 (06) :285-288

[4] OPTIMAL PACKING AND COVERING IN THE PLANE ARE NP-COMPLETE [J].

FOWLER, RJ ;

PATERSON, MS ;

TANIMOTO, SL .

INFORMATION PROCESSING LETTERS, 1981, 12 (03) :133-137

[5] OPTIMUM DISTRIBUTION OF SWITCHING CENTERS IN A COMMUNICATION NETWORK AND SOME RELATED GRAPH THEORETIC PROBLEMS [J].

HAKIMI, SL .

OPERATIONS RESEARCH, 1965, 13 (03) :462-&

[6] OPTIMUM LOCATIONS OF SWITCHING CENTERS + ABSOLUTE CENTERS + MEDIANS OF GRAPH [J].

HAKIMI, SL .

OPERATIONS RESEARCH, 1964, 12 (03) :450-&

[7] A BEST POSSIBLE HEURISTIC FOR THE K-CENTER PROBLEM [J].

HOCHBAUM, DS ;

SHMOYS, DB .

MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (02) :180-184

[8]

HOCHBAUM DS, IN PRESS J ASS COMPU

[9] EASY AND HARD BOTTLENECK LOCATION-PROBLEMS [J].

HSU, WL ;

NEMHAUSER, GL .

DISCRETE APPLIED MATHEMATICS, 1979, 1 (03) :209-215

[10] EFFICIENT ALGORITHMS FOR SHORTEST PATHS IN SPARSE NETWORKS [J].

JOHNSON, DB .

JOURNAL OF THE ACM, 1977, 24 (01) :1-13

← 1 2 →