度量k-中位数问题的逆贪心算法
The reverse greedy algorithm for the metric k-median problem
摘要:
用于k中值问题的反向贪心算法(RGreedy)的工作原理如下。它首先在所有节点上放置设施。在每一步中,它都会删除一个设施,以最小化从客户到其余设施的总距离。当k设施剩余时,它停止。我们证明,如果距离函数是度量,那么RGreedy的逼近比之间?(log n/ log log n)和O(log n)。
英文摘要:
The Reverse Greedy algorithm (RGreedy) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the resulting total distance from the customers to the remaining facilities. It stops when k facilities remain. We prove that, if the distance function is metric, then the approximation ratio of RGreedy is between ?(log n/ log log n) and O(log n).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。