@inproceedings{8e6f8f7459cb4530bb72b2509a15e037,
title = "The mixed center location problem",
abstract = "This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem where one of the centers must be in P and solve it in O(n2 log n) time. Next we consider the mixed k-center problem where m of the centers are in P. Motivated by two practical constraints, we propose two variations of the problem. We present an exact algorithm, a 2-approximation algorithm and a heuristic algorithm solving the mixed k-center problem. The time complexity of the exact algorithm is O (nm+O√(k-m)).",
keywords = "Computational geometry, Facility location problem, K-center problem, Voronoi diagram",
author = "Yi Xu and Jigen Peng and Yinfeng Xu",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2016.; 10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016 ; Conference date: 16-12-2016 Through 18-12-2016",
year = "2016",
doi = "10.1007/978-3-319-48749-6\_25",
language = "英语",
isbn = "9783319487489",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "340--349",
editor = "Minming Li and Lusheng Wang and Chan, \{T-H. Hubert\}",
booktitle = "Combinatorial Optimization and Applications - 10th International Conference, COCOA 2016, Proceedings",
}