Author:
Bandyapadhyay Sayan,Fomin Fedor V.,Golovach Petr A.,Purohit Nidhi,Siminov Kirill
Publisher
Springer International Publishing
Reference52 articles.
1. Aggarwal, C.C., Reddy, C.K. (eds.): Data Clustering: Algorithms and Applications. CRC Press, Boca Raton (2013)
2. Agrawal, A., Saurabh, S., Tale, P.: On the parameterized complexity of contraction to generalization of trees. In: 12th International Symposium on Parameterized and Exact Computation (IPEC). LIPIcs, vol. 89, pp. 1:1–1:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)
3. Ahmadian, S., Norouzi-Fard, A., Svensson, O., Ward, J.: Better guarantees for $$k$$-means and Euclidean $$k$$-median by primal-dual algorithms. In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp. 61–72. IEEE Computer Society (2017)
4. Alon, N., Sudakov, B.: On two segmentation problems. J. Algorithms 33(1), 173–184 (1999)
5. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean $$k$$-medians and related problems. In: Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 106–113. ACM, New York (1998)