In the Asymmetric k-Center problem, the input is an integer k and a complete digraph over n points together with a distance function obeying the directed triangle inequality. The goal is to choose a set of k points to serve as centers and to assign all the points to the centers, so that the maximum distance of any point to its center is as small as possible. We sho
Given a simple polygon P with n vertices and a set Q of m points in P. we consider the geodesic k-ce...
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete lo...
In the discrete k-Center problem, we are given a metric space (P,dist) where |P| = n and the goal is...
In the Asymmetric k-Center problem, the input is an integer k and a complete digraph over n points t...
In the Asymmetric k-Center problem, the input is an integer k and a complete digraph over n points t...
We show that the asymmetric k-center problem is 34 n)-hard to approximate unless NP DTIME(n ...
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
The input to the asymmetric p-center problem consists of an integer p and an n x n distance matrix D...
AbstractThis paper explores three concepts: the k-center problem, some of its variants, and asymmetr...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
The $k$-center problem with triangle inequality is that of placing $k$ center nodes in a weighted un...
y The kcenter problem with triangle inequality is that of placing k center nodes in a weighted undir...
This research focuses on the k-center problem and its applications. Different methods for solving th...
The capacitated K-center problem is a fundamental facility location problem, where we are asked to l...
Given a simple polygon P with n vertices and a set Q of m points in P. we consider the geodesic k-ce...
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete lo...
In the discrete k-Center problem, we are given a metric space (P,dist) where |P| = n and the goal is...
In the Asymmetric k-Center problem, the input is an integer k and a complete digraph over n points t...
In the Asymmetric k-Center problem, the input is an integer k and a complete digraph over n points t...
We show that the asymmetric k-center problem is 34 n)-hard to approximate unless NP DTIME(n ...
This paper explores three concepts: the k-center problem, some of its variants, and asymmetry. The k...
The input to the asymmetric p-center problem consists of an integer p and an n x n distance matrix D...
AbstractThis paper explores three concepts: the k-center problem, some of its variants, and asymmetr...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
The k-center problem with triangle inequality is that of placing k center nodes in a weighted undire...
The $k$-center problem with triangle inequality is that of placing $k$ center nodes in a weighted un...
y The kcenter problem with triangle inequality is that of placing k center nodes in a weighted undir...
This research focuses on the k-center problem and its applications. Different methods for solving th...
The capacitated K-center problem is a fundamental facility location problem, where we are asked to l...
Given a simple polygon P with n vertices and a set Q of m points in P. we consider the geodesic k-ce...
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete lo...
In the discrete k-Center problem, we are given a metric space (P,dist) where |P| = n and the goal is...
DOI
Add to ORKG