[1] CHRISTOFIDES N.:
Graрh Theory: an Algorithmic Approach. Academic Press, London, 1975.
MR 0429612
[2] DYER M. E., FRIEZE A. M.:
A simple heuristic for the p-centre problem. J. Oper. Res. Soc. 35, 1984, 285-288.
MR 0797340
[3] GAREY M. R., JOHNSON D. S.:
Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
MR 0519066 |
Zbl 0411.68039
[4] HAKIMI S. L.:
Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Res. 12, 1964, 450-459.
Zbl 0123.00305
[5] HOCHBAUM D. S., SHMOYS D. B.:
A best possible heuristic for the k-center problem. Math. Opeг. Res. 10, 1985, 180-184.
MR 0793876 |
Zbl 0565.90015
[6] HOCHBAUM D. S., SHMOYS D. B.:
A unified approach to approximation algorithms for bottleneck problems. J. Assoc. Comput. Mach. 33, 1986, 533-550.
MR 0849028
[7] HSU W. L., NEMHAUSER G. L.:
Easy and hard bottleneck location problems. Discrete Appl. Math. 1, 1979, 209-215.
MR 0549500 |
Zbl 0424.90049
[8] KARIV O., HAKIMI S. L.:
An algorithmic approach to network location problems I: the p-centers. SIAM J. Appl. Math. 37, 1979, 513-538.
MR 0549138 |
Zbl 0432.90074
[9] MINIEKA E.:
The centeгs and medians of a gгaph. Opeгations Res. 25, 1977, 641-650.
MR 0524906
[10] PLESNÍK J.:
On the computational complexity of centers locating in a graph. Aplikace Mat. 25, 1980, 445-452.
MR 0596851 |
Zbl 0454.68026
[11] PLESNÍK J.:
A heuristic for thep-center problem in graphs. Discrete Appl. Math. 17, 1987, 263-268.
MR 0890636
[12] PLESNÍK J.:
On the interchange heuristic for locating centers and medians in a graph. Math. Slovaca, 37, 1987, 209-216.
MR 0899438 |
Zbl 0642.05030
[13] TANSEL B. C., FRANCIS R. L., LOWE T. J.:
Location on networks: a survey; part I: the p-center and p-median problems. Management Sci. 29, 1983, 482-497.
MR 0704593
[14] WONG R. T.:
Location and netwoгk design. In: Combinatorial Optimization: Annotated Bibliographies (M. O'hEigeaгtaigh, J. K. Lenstra and A. H. G. Rinnooy Kan, eds.), Wiley, New York, 1985, 129-147.
MR 0807391