[1] Minieka E. The centers and medians of a graph[J]. Operations Research, 1977, 25(4): 641-650. [2] Garfinkel R S, Neebe A W, Rao M R. The m-center problem: Minimaxfacality location[J]. Management Science, 2011, 23(10): 1133-1142. [3] Tansel B C, Francis R L, Lowe T J. State of the art—location on networks: a survey. part I: the p-center and p-median problems[J]. Management science, 1983, 29(4): 482-497. [4] Wang H, Zhang J. Line-constrained k-median, k-means, and k-center problems in the plane[J]. Algorithms and Computation, 2014: 3-14. [5] Hwang R, Lee R, Chang R. The slab dividing approach to solve the euclidean p-center problem[J]. Algorithmica, 1993, 9(1): 1-22. [6] Wang H, Zhang J. An $O(n\log_{}n)$-time algorithm for the k-center problem in trees[C]. In: Proceedings of the 34th International Symposium on Computational Geometry (SoCG 2018), 2018, 72: 1-15. [7] Fowler R J, Paterson M S, Tanimoto S L. Optimal packing and covering in the plane are NP-complete[J]. Information Processing Letters, 1981, 12(3): 133-137. [8] Elloumi S, Labbe M, Pochet Y. A new formulation and resolution method for the p-center problem[J]. Informs Journal on Computing, 2004, 16(1): 84-94. [9] Minieka E. The centers and medians of a graph[J]. Operations Research, 1977, 25(4): 641-650. [10] Lin G, Xue G. K-center and k-median problems in graded distances[J]. Theoretical computer science, 1998, 207(1): 181-192. [11] Halfin S. On finding the absolute and vertex centers of a tree with distances[J]. Transportation Science, 1974, 8(1): 75-77. [12] Du H, Xu Y. An approximation algorithm for k-center problem on a convex polygon[J]. Journal of Combinatorial Optimization, 2014, 27(3): 504-518. [13] Xu Y, Peng J, Xu Y. The mixed center location problem[J]. Journal of Combinatorial Optimization, 2018, 36(4): 1128-1144. [14] Tan X, Jiang B. Simple algorithms for the planar 2-center problem[C]. International Computing and Combinatorics Conference. Springer, Cham, 2017: 481-491. [15] Chan T M. More planar two-center algorithms[J]. Computational Geometry, 1999, 13(3): 189-198. [16] Xu Y, Peng J, Xu Y, Zhu B. The discrete and mixed minimax 2-center problems[J]. Theoretical Computer Science, 2019, 774: 95-102. [17] Bhattacharya B, Mozafari A, Shermer T C. An efficient algorithm for the proximity connected two center problem[C]. International Workshop on Combinatorial Algorithms. Springer, Cham, 2022: 199-213. [18] Bajaj C. The algebraic degree of geometric optimization problems[J]. Discrete Computational Geometry, 1988, 3: 177-191. [19] Ho J M, Lee D T, Chang C H, et al. Minimum diameter spanning trees and related problems[J]. SIAM Journal on Computing, 1991, 20(5): 987-997. [20] Hassin R, Tamir A. On the minimum diameter spanning tree problem[J]. Information Processing Letters, 1995, 53(2): 109-111. [21] Chan T M. Semi-online maintenance of geometric optima and measures[J]. SIAM Journal on Computing, 2003, 32(3): 700-716. |