Add to ORKGWe 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 smallest possible radius, centered at two points of P, whose union covers P. Our algorithm runs in time O(n 4=3 log 5 n).
[[abstract]]Given a set S of n points in the plane and a constant alpha, the alpha-connected two-cen...
Given a set P of n points in the plane, we seek two squares such that their center points belong to ...
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane,...
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; tha...
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; th...
We present an O(n log 9 n)-time algorithm for computing the 2-center of a set S of n points in the p...
We give exact and approximation algorithms for two-center problems when the input is a set D of disk...
We consider new versions of the two-center problem where the input consists of a set D of disks in t...
AbstractThis paper considers the planar Euclidean two-center problem: given a planar n-point set S, ...
We consider the Euclidean 2-center problem for a set of n disks in the plane: find two smallest cong...
Let S be a set of n points in R3. We study the discrete 2-center problem. The goal is to find two cl...
Let P be a set of n points in R³. The 2-center problem for P is to find two congruent balls of minim...
[[abstract]]This paper considers the connected two-center problem, which is to find two congruent cl...
AbstractWe provide lower and upper bounds for γ(n), the number of optimal solutions for the two-cent...
AbstractGiven a set P of n points in the plane, we seek two squares such that their center points be...
[[abstract]]Given a set S of n points in the plane and a constant alpha, the alpha-connected two-cen...
Given a set P of n points in the plane, we seek two squares such that their center points belong to ...
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane,...
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; tha...
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; th...
We present an O(n log 9 n)-time algorithm for computing the 2-center of a set S of n points in the p...
We give exact and approximation algorithms for two-center problems when the input is a set D of disk...
We consider new versions of the two-center problem where the input consists of a set D of disks in t...
AbstractThis paper considers the planar Euclidean two-center problem: given a planar n-point set S, ...
We consider the Euclidean 2-center problem for a set of n disks in the plane: find two smallest cong...
Let S be a set of n points in R3. We study the discrete 2-center problem. The goal is to find two cl...
Let P be a set of n points in R³. The 2-center problem for P is to find two congruent balls of minim...
[[abstract]]This paper considers the connected two-center problem, which is to find two congruent cl...
AbstractWe provide lower and upper bounds for γ(n), the number of optimal solutions for the two-cent...
AbstractGiven a set P of n points in the plane, we seek two squares such that their center points be...
[[abstract]]Given a set S of n points in the plane and a constant alpha, the alpha-connected two-cen...
Given a set P of n points in the plane, we seek two squares such that their center points belong to ...
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane,...