منابع مشابه
The Non-Uniform k-Center Problem
In this paper, we introduce and study the Non-Uniform k-Center (NUkC) problem. Given a finite metric space (X, d) and a collection of balls of radii {r1 ≥ · · · ≥ rk}, the NUkC problem is to find a placement of their centers on the metric space and find the minimum dilation α, such that the union of balls of radius α · ri around the ith center covers all the points in X . This problem naturally...
متن کاملThe Capacitated K-Center Problem
The capacitated K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation...
متن کاملLecture 14 : k - center Problem
Given a set P of n points in R, a typical clustering problem asks for partitioning P into a family of k subsets {P1, . . . , Pk}, so that a certain objective function is minimized. The objective function depends on the application and varies. A typical clustering problem is the so-called centered clustering problem in which a representative point ci (or a q-flat) is chosen for each cluster Pi a...
متن کاملThe Capacitated K - Center Problem 1
The capacitated K-center problem is a fundamental facility location problem, where we are asked to locate K facilities in a graph, and to assign vertices to facilities, so as to minimize the maximum distance from a vertex to the facility to which it is assigned. Moreover, each facility may be assigned at most L vertices. This problem is known to be NP-hard. We give polynomial time approximation...
متن کاملThe p-Neighbor k-Center Problem
The k center problem with triangle inequality is that of placing k center nodes in a weighted undirected graph in which the edge weights obey the triangle inequality so that the maximum distance of any node to its nearest center is minimized In this paper we consider a generalization of this problem where given a number p we wish to place k centers so as to minimize the maximum distance of any ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2020
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3392720