We present an algorithm for computing the discrete 2-center of a set P
of n points in the plane; that is, computing two congruent disks of s
mallest possible radius, centered at two points of P, whose union cove
rs P. Our algorithm runs in time O(n(4/3) log(5) n).