Author:
Wu Xiaoliang,Shi Feng,Guo Yutian,Zhang Zhen,Huang Junyu,Wang Jianxin
Publisher
Springer Science and Business Media LLC
Reference29 articles.
1. Ravishankar K, Li S, Sandeep S. Constant approximation for k-median and k-means with outliers via iterative rounding. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018. 646–659
2. Hochbaum D S, Shmoys D B. A best possible heuristic for the k-center problem. Math Oper Res, 1985, 10: 180–184
3. Li S, Svensson O. Approximating k-median via pseudo-approximation. SIAM J Comput, 2016, 45: 530–547
4. Chen D Z, Huang Z Y, Liu Y W, et al. On clustering induced Voronoi diagrams. In: Proceedings of the 54th Annual Symposium on Foundations of Computer Science, 2013. 390–399
5. Hochbaum D S, Shmoys D B. A unified approach to approximation algorithms for bottleneck problems. J ACM, 1986, 33: 533–550
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献