Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference16 articles.
1. Agarwal, A., Charikar, M., Makarychev, K., Makarychev, Y.:
$$O(\sqrt{\log n})$$
O
(
log
n
)
-approximation algorithms for Min UnCut, Min-2CNF Deletion, and directed cut problems. In: Proceedings of STOC (2005)
2. Arya, V., Garg, N., Khandekar, R., Meyerson, A., Munagala, K., Pandit, V.: Local search heuristics for
$$k$$
k
-median and facility location problem. SIAM J. Comput. 33, 544–562 (2004)
3. Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic application. In: Proceedings of FOCS (1996)
4. Bartal, Y., Charikar, M., Raz, D.: Approximating min-sum
$$k$$
k
-clustering in metric spaces. In: Proceedings of STOC (2001)
5. Byrka, J., Pensyl, T., Rybicki, B., Srinivasan, A., Trinh, K.: An improved approximation for
$$k$$
k
-median, and positive correlation in budgeted optimization. In: Proceedings of SODA (2015)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献