An Experimental Evaluation of Incremental and Hierarchical
Workshop on Experimental and Efficient Algorithms(2011)
摘要
In this paper, we consider different incremental and hierarchical k-median algorithms with provable performance guarantees and compare their running times and quality of output solutions on
different benchmark k-median datasets. We determine that the quality of solutions output by these algorithms for all the datasets is much better
than their performance guarantees suggest. Since some of the incremental k-median algorithms require approximate solutions for the k-median problem, we also compare some of the existing k-median algorithms’ running times and quality of solutions obtained on these datasets.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要