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.