k-median问题反向贪心随机算法

计算机科学 ›› 2012, Vol. 39 ›› Issue (7): 232-236.

k-median问题反向贪心随机算法

王守强

(山东交通学院信息科学与电气工程学院济南 250023)

出版日期:2018-11-16 发布日期:2018-11-16

Randomized Reverse Greedy Algorithm for k-median Problem

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： k-median问题的近似算法研究一直是计算机科学工作者关注的焦点。基于均衡限制条件，利用反向贪心策略，给出求解该问题的随机近似算法。证明该算法以较大的概率满足其近似性能比的期望值为((3} O(ln(ln(k)/a)).该算法的时间复杂度为O[k/a ln(k)]2(n+m)，其中，和二分别代表设施集合以及客户点集的大小。最后，通过计算机实验验证了k-median问题的反向贪心算法的实际计算效果。

关键词: k-median，随机算法，反向贪心，近似性能比

Abstract: Research on the approximated algorithms for k-median problem has been a focus of computer scientists.Based on the balanced parameter, this paper presented a randomized algorithm for k-median problem by means of the reverse greedy. The new algorithm's expected approximate ratio was proved to be(3}0(ln(ln(k)/a)) with high probability. The running time of the new algorithm is巨立ln(k)习z(二+二)，wher。二。nd yn represent the number of clients and facilities for the given instance. Finally,computer verification was used to study the real computational effect of the al gorithm.

Key words: k- median, Randomized algorithm, Reverse greedy, Aapproximation ratio

王守强. k-median问题反向贪心随机算法[J]. 计算机科学, 2012, 39(7): 232-236. https://doi.org/

参考文献

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed