A Constant-Factor Approximation Algorithm for the k-Median Problem
نویسندگان
چکیده
منابع مشابه
A constant-factor approximation algorithm for the k-median problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are relatively close with respect to some measure. For the metric k-median problem, we are given n poin...
متن کاملConstant factor approximation algorithm for the knapsack median problem
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each facility has a facility opening cost, and we are also given a budget B. The objective is to open a subset of facilities of total cost at most B, and minimize the total connection cost of the clients. This settles an open...
متن کاملA Constant-Factor Approximation Algorithm for the k-MST Problem
Given an undirected graph with non negative edge costs and an inte ger k the k MST problem is that of nding a tree of minimum cost on k nodes This problem is known to be NP hard We present a simple approximation algorithm that nds a solution whose cost is less than times the cost of the optimum This improves upon previous performance ratios for this problem O p k due to Ravi et al O log k due t...
متن کاملConstant-Factor Approximation for Ordered k-Median
We study the Ordered k-Median problem, in which the solution is evaluated by first sorting the client connection costs and then multiplying them with a predefined non-increasing weight vector (higher connection costs are taken with larger weights). Since the 1990s, this problem has been studied extensively in the discrete optimization and operations research communities and has emerged as a fra...
متن کاملA Constant-Factor Approximation Algorithm for k-MST Problem
Given an undirected graph with nonnegative edge costs and an integer k, the k-MST problem is that of finding a tree of minimum cost on k nodes. This problem is known to be NP-hard. We present a simple approximation algorithm that finds a solution whose cost is less than 17 times the cost of the optimum. This improves upon previous performance ratios for this problem &O(k) due to Ravi et al., O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2002
ISSN: 0022-0000
DOI: 10.1006/jcss.2002.1882