This is a preview of subscription content, log in via an institution to check access.
References
S. Hakimi, “Optimum location of switching centers and the absolute centers and medians of a graph,” Oper. Res.,12, No. 3, 450–459 (1964).
N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, New York (1975).
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedra, Graphs, and Optimization, [in Russian], Nauka, Moscow (1981).
V. A. Emelichev, O. I. Mel'nikov, V. I. Sarvanov, and R. I. Tyshkevich, Lectures in Graph Theory [in Russian], Nauka, Moscow (1990).
M. R. Garey and D. S. Johnson, Computers and Intractability. Freeman, San Francisco (1979).
A. D. Korshunov, “Fundamental properties of random graphs with many vertices and edges,” UMN,40, No. 1 (241), 107–173 (1985).
V. A. Perepelitsa, “Asymptotic approach to the solution of some extremal problems in graphs,” Probl. Kibern., No, 26, 291–314 (1973).
Additional information
The study was carried out with financial support from the Foundation for Basic Research of the Republic of Belarus.
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 109–117, September–October, 1994.
Rights and permissions
About this article
Cite this article
Emelichev, V.A., Efimchik, N.E. Asymptotic approach to the problem of k-median of a graph. Cybern Syst Anal 30, 726–732 (1994). https://doi.org/10.1007/BF02367754
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02367754