[1] 田辉, 范绍帅, 吕昕晨, 等. 面向5G需求的移动边缘计算[J]. 北京邮电大学学报, 2017, 40(2):1-10. Tian H, Fan S, Lv X, et al. Mobile edge computing for 5G requirements[J]. Journal of Beijing University of Posts and Telecommunications, 2017, 40(2):1-10.
[2] Gao L, Luan T H, Yu S, et al. FogRoute:DTN-based data dissemination model in fog computing[J]. IEEE Internet of Things Journal, 2017, 4(1):225-235.
[3] Kariv O, Hakimi S L. An algorithmic approach to network location problems. I:the p-centers[J]. Siam Journal on Applied Mathematics, 1979, 37(3):513-538.
[4] Kariv O, Hakimi S L. An algorithmic approach to network location problems. II:the p-medians[J]. Siam Journal on Applied Mathematics, 1979, 37(3):539-560.
[5] Tamir A. An O(pn 2) algorithm for the p-median and related problems on tree graphs[J]. Operations Research Letters, 1996, 19(2):59-64.
[6] Rolland E, Schilling D A, Current J R. An efficient tabu search procedure for the p-median problem[J]. European Journal of Operational Research, 1997, 96(2):329-342.
[7] Charikar M, Guha S, Shmoys D B. A constant-factor approximation algorithm for the k-median problem[J]. Journal of Algorithms, 2003, 65(1):129-149.
[8] Lorena L A N, Furtado J C. Constructive genetic algorithm for clustering problems[J]. Evolutionary Computation, 2001, 9(3):309-327. |