Add to ORKG[[abstract]]©1990 Elsevier-Considers the unweighted m-center problem with rectilinear distance. The authors present an O(nm-2 log n) algorithm for the m-center problem where m⩾4[[department]]資訊工程學
AbstractRectilinear k-centers of a finite point set P⊂R2 are the centers of at most k congruent axis...
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
Thep-center problem consists of choosingp facilities among a set ofM possible locations and assignin...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
[[abstract]]Given a set of n points on the plane, the rectilinear m-center problem is to find n rect...
[[abstract]]Given n demand points with positive weights on the plane, the weightedrectilinearm-cente...
We present efficient algorithms for two problems of facility location. In both problems we want to o...
The input to the asymmetric p-center problem consists of an integer p and an n x n distance matrix D...
An extended star is a tree which has only one vertex with degree larger than two. The -center proble...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
Given a set of points in the plane and a constant ,(, 1, 1, )-center problem is to find two closed...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
algorithm for the problem of finding a point (x, y) in the plane that minimizes the maximal weighted...
We show that the asymmetric k-center problem is 34 n)-hard to approximate unless NP DTIME(n ...
In this work we study and investigate the minimum width annulus problem (MWAP), the circle center lo...
AbstractRectilinear k-centers of a finite point set P⊂R2 are the centers of at most k congruent axis...
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
Thep-center problem consists of choosingp facilities among a set ofM possible locations and assignin...
[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com...
[[abstract]]Given a set of n points on the plane, the rectilinear m-center problem is to find n rect...
[[abstract]]Given n demand points with positive weights on the plane, the weightedrectilinearm-cente...
We present efficient algorithms for two problems of facility location. In both problems we want to o...
The input to the asymmetric p-center problem consists of an integer p and an n x n distance matrix D...
An extended star is a tree which has only one vertex with degree larger than two. The -center proble...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
Given a set of points in the plane and a constant ,(, 1, 1, )-center problem is to find two closed...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
algorithm for the problem of finding a point (x, y) in the plane that minimizes the maximal weighted...
We show that the asymmetric k-center problem is 34 n)-hard to approximate unless NP DTIME(n ...
In this work we study and investigate the minimum width annulus problem (MWAP), the circle center lo...
AbstractRectilinear k-centers of a finite point set P⊂R2 are the centers of at most k congruent axis...
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
Thep-center problem consists of choosingp facilities among a set ofM possible locations and assignin...