当前位置: X-MOL 学术Inf. Process. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Reverse greedy is bad for k-center
Information Processing Letters ( IF 0.7 ) Pub Date : 2020-03-10 , DOI: 10.1016/j.ipl.2020.105941
D. Ellis Hershkowitz , Gregory Kehne

We show the reverse greedy algorithm is between a (2k2)- and a 2k-approximation for k-center.



中文翻译:

反贪心对k中心不利

我们展示了反向贪婪算法在 2ķ-2-和2 ķ -近似为ķ -center。

更新日期:2020-03-10
down
wechat
bug