k-median问题:在备选工厂集里面选定k个工厂,使得需求点到离它最近工厂的加权距离总和最小. 2 方法 近似方法分为两种:近似算法(Approximate Algorithms)和启发式算法(Heuristic Algorithms).近似算法通常有质量保证的解.然而启发式算法通常可找到在传统解决问题的经验中找到寻求一种面向问题的策略,之后用这种策略来在可行...
We address a general fault-tolerant version of the k-median problem on a network. Unlike the original k-median, the objective is to find k nodes (medians or facilities) of a network, assign each non-median node (customer) to r j distinct medians, and each median ...
AGeneticAlgorithmforthek-MedianProblemLIQiang (DepartmentofComputerScienceandTechnology,BinzhouUniversity,Shandong,Binzhou,256600) Abstract:k-Medianproblemhasimportantapplicationsinboththeoreticandrealisticfields.Anewgeneticalgorithmisproposedwhichusesdifferenceselectstrategiesforcrossoverandmutationoperators.Theproposedalgorithm...
Inspired by the algorithm of Charikar, Guha, Tardos and Shmoys, we give a$(6+10\\alpha)$-approximation algorithm for this problem with increasing thecapacities by a factor of $2+\\frac{2}{\\alpha}, \\alpha\\geq 4$, which improvesthe previous best $(32 l^2+28 l+7)$-...
A Nearly Linear-Time Approximation Scheme for the Euclidean k -Median Problem 来自 Semantic Scholar 喜欢 0 阅读量: 24 作者: SG Kolliopoulos,S Rao 摘要: Summary: This paper provides a randomized approximation scheme for the $k$-median problem when the input points lie in the $d$-...
The polyhedral structure of the K -median problem on a tree is examined. Even for very small connected graphs, we show that additional constraints are needed to describe the integer polytope. A complete description is given of those trees for which an optimal integer LP solution is guaranteed ...
This paper provides a randomized approximation scheme for the k- median problem when the input points lie in the d- dimensional Euclidean space. The worst- case running time is O(2(O)((log( 1/epsilon)/epsilon)(d-1)) n log(d+6) n), which is nearly linear for any fixed epsilon and...
A k-Median Algorithm with Running Time Independent of Data Size作者:Adam Meyerson, Liadan O'Callaghan, Serge Plotkin 摘要 We give a sampling-based algorithm for the k-Median problem, with running time O(k \((\frac{{k^2 }}{ \in } \log k)^2 \) log\((\frac{k}{ \in } \log ...
In the k-median problem we are given a set S of n points in a metric space and a positive integer k: The objective is to locate k medians among the points ... SG Kolliopoulos,S Rao - 《Lecture Notes in Computer Science》 被引量: 282发表: 1999年 Median K-flats for hybrid linear...
We propose the first (k, ε)-coreset constructions for the probabilistic k-median problem in the metric and Euclidean case. The coresets are of size poly(ε −1, k, log(W/(p min⋅δ))), where W is the expected total weight of the weighted probabilistic input points when all ...