AbstractWe obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising from a geometric client–server problem. The second is the problem of moving points towards an independent set
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete lo...
AbstractIn this work, we study an extension of the k-center facility location problem, where centers...
In this paper we consider a generalization of the classical k-center problem with capacities. Our go...
AbstractTwo complications frequently arise in real-world applications, motion and the contamination ...
In the discrete k-Center problem, we are given a metric space (P,dist) where |P| = n and the goal is...
In the classical maximum independent set problem, we are given a graph G of "conflicts" and are aske...
We study the capacitated k-center problem with vertex weights. It is a generalization of the well kn...
The $k$-center problem with triangle inequality is that of placing $k$ center nodes in a weighted un...
We study the 2-center problem for moving points in the plane. Given a set P of n points, the Euclide...
We study two versions of the 2-center problem for moving points in the plane. Given a set P of n poi...
The capacitated $K$-center problem is a fundamental facility location problem, where we are asked to...
In this paper we study the hardness of the k-Center problem on inputs that model transportation netw...
AbstractThe basic K-center problem is a fundamental facility location problem, where we are asked to...
We study the parameterized complexity of the k-center problem on an given n-point set P in Rd, with ...
In this paper we study several instances of the aligned k-center problem where the goal is, given a ...
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete lo...
AbstractIn this work, we study an extension of the k-center facility location problem, where centers...
In this paper we consider a generalization of the classical k-center problem with capacities. Our go...
AbstractTwo complications frequently arise in real-world applications, motion and the contamination ...
In the discrete k-Center problem, we are given a metric space (P,dist) where |P| = n and the goal is...
In the classical maximum independent set problem, we are given a graph G of "conflicts" and are aske...
We study the capacitated k-center problem with vertex weights. It is a generalization of the well kn...
The $k$-center problem with triangle inequality is that of placing $k$ center nodes in a weighted un...
We study the 2-center problem for moving points in the plane. Given a set P of n points, the Euclide...
We study two versions of the 2-center problem for moving points in the plane. Given a set P of n poi...
The capacitated $K$-center problem is a fundamental facility location problem, where we are asked to...
In this paper we study the hardness of the k-Center problem on inputs that model transportation netw...
AbstractThe basic K-center problem is a fundamental facility location problem, where we are asked to...
We study the parameterized complexity of the k-center problem on an given n-point set P in Rd, with ...
In this paper we study several instances of the aligned k-center problem where the goal is, given a ...
In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete lo...
AbstractIn this work, we study an extension of the k-center facility location problem, where centers...
In this paper we consider a generalization of the classical k-center problem with capacities. Our go...
DOI
Add to ORKG