The ordered k-median problem: surrogate models and approximation algorithms
نویسندگان
چکیده
منابع مشابه
Interpolating between k-Median and k-Center: Approximation Algorithms for Ordered k-Median
We consider a generalization of k-median and k-center, called the ordered k-median problem. In this problem, we are given a metric space (D, {cij}) with n = |D| points, and a non-increasing weight vector w ∈ Rn+, and the goal is to open k centers and assign each point each point j ∈ D to a center so as to minimize w1 · (largest assignment cost) + w2 · (second-largest assignment cost) + . . . + ...
متن کامل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...
متن کاملAlgorithms for the Bregman k-Median problem
In this thesis, we study the k-median problem with respect to a dissimilarity measure Dφ from the family of Bregman divergences: Given a finite set P of size n from R, our goal is to find a set C of size k such that the sum of error cost(P,C) = ∑ p∈P minc∈C { Dφ(p, c) } is minimized. This problem plays an important role in applications from many different areas of computer science, such as info...
متن کاملApproximation Algorithms for Aversion k-Clustering via Local k-Median
In the aversion k-clustering problem, given a metric space, we want to cluster the points into k clusters. The cost incurred by each point is the distance to the furthest point in its cluster, and the cost of the clustering is the sum of all these per-point-costs. This problem is motivated by questions in generating automatic abstractions of extensive-form games. We reduce this problem to a “lo...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2018
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-018-1259-3