In graph theory, the metric k-center problem is a combinatorial optimization problem studied in theoretical computer science. Given n cities with specified ...

Sep 26, 2017 · In O(nk) time we can compute the distance between each of the n points and each of the k centers, and assign each point to its closest center.).

We will study this problem, called the k-center problem, and its weighted version, under the restriction that the edge costs satisfy the triangle inequality.

Mar 14, 2024 · Given n cities and distances between every pair of cities, select k cities to place warehouses (or ATMs or Cloud Server) such that the ...

Jul 28, 2023 · Abstract:In this paper we give the first efficient algorithms for the k-center problem on dynamic graphs undergoing edge updates.

Jun 22, 2021 · We call this the continuous space. It means that there are infinitely many facility locations and also C⊆L. Therefore, an algorithm for ...

Abstract. The capacitated K-center problem is a basic facility location problem, where we are asked to locate K facilities in a graph and to assign vertices ...

May 18, 2021 · In this paper, we develop the first highly scalable approximation algorithm for k-center clustering, with O~(n^ε) space per machine and O~(n^(1+ ...

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for ...