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

D.S. Hochbaum and D.B. Shmoys. A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM, 33: 533–550, 1986.

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.).

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

Feb 5, 2007 · In this lecture, we will consider the K-center problem, both in its symmetric and asymmetric variants. For this lecture, recall that a ...

The k-center problem asks: given a set S and an integer k, find the smallest ... A basic fact about the k-center problem is that it is NP-hard. Thus there is ...

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 ...

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 ...

Duration: 50:45
Posted: Sep 20, 2023

Apr 12, 2023 · In this paper we extend the algorithm of Bateni et al. and design a low-local-space MPC algorithm that in \mathcal{O}(\log\log n) rounds returns ...