@inproceedings{46f259be4afe46bb9dafefbb66410594,
title = "The discrete and mixed minimax 2-center problem",
abstract = "Let P be a set of n points in the plane, the discrete minimax 2-center problem (DMM2CP) is that of finding two disks centered at \{p1,p2\}∈P that minimize the maximum of two terms, namely, the Euclidean distance between two centers and the distance of any other point to the closer center. The mixed minimax 2-center problem (MMM2CP) is when one of the two centers is not in P. We present algorithms for solving the DMM2CP and MMM2CP. The time complexity of solving DMM2CP and MMM2CP are O(n2log n) and O(n2log2n) respectively.",
keywords = "2-center problem, Computational geometry, Farthest point Voronoi diagram",
author = "Yi Xu and Jigen Peng and Yinfeng Xu and Binhai Zhu",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 9th International Conference on Combinatorial Optimization and Applications, COCOA 2015 ; Conference date: 18-12-2015 Through 20-12-2015",
year = "2015",
doi = "10.1007/978-3-319-26626-8\_8",
language = "英语",
isbn = "9783319266251",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "101--109",
editor = "Donghyun Kim and Weili Wu and Ding-Zhu Du and Zaixin Lu and Wei Li",
booktitle = "Combinatorial Optimization and Applications - 9th International Conference, COCOA 2015, Proceedings",
}