.png){kind=icon}
返回
An approximation algorithm for lower-bounded k-median with constant factor
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-021-3411-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The lower-bounded k-median problem plays a key role in many applications related to privacy protection, which requires that the amount of assigned client to each facility should not be less than the requirement. Unfortunately, the lower-bounded clustering problem remains elusive under the widely studied k-median objective. Within this paper, we convert this problem to the capacitated facility location problem and successfully give a (516 + epsilon-approximation for this problem.
Keyword:
approximation algorithm
k-median
lower-bounded k-median
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容