Constant 1731-1749, 2019. ,
Smaller coresets for k-median and k-means clustering ,
, Discrete & Computational Geometry, vol.37, issue.1, pp.3-19, 2007.
On coresets for k-means and k-median clustering ,
, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, p.548
, , pp.291-300, 2004.
A simple linear time (1+ ") -approximation 551 algorithm for k-means clustering in any dimensions, Proceedings of the 45th Annual IEEE 552 ,
, Symposium on Foundations of Computer Science, FOCS '04, p.553
, IEEE Computer Society. Available, vol.7, 2004.
Linear-time approximation schemes 556 for clustering problems in any dimensions, J. ACM, vol.57, issue.2, 2010. ,
Partitioning a graph into small pieces with applications to path trans-559 versal, Mathematical Programming, vol.560, pp.10107-10125, 2018. ,
On uniform capacitated k-median beyond the natural LP relaxation, Proceedings 562 of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, vol.2015, p.563 ,
, , pp.696-707, 2015.
Approximating capacitated k-median with (1 + k open facilities, Proceedings of 566 the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, vol.2016, p.567 ,
, , pp.786-796, 2016.
On uniform capacitated k-median beyond the natural LP relaxation ,
, Algorithms, vol.13, issue.2, p.571, 2017.
Non-573 linear dimension reduction via outer bi-lipschitz extensions, Proceedings of the 50th Annual, vol.574 ,
, ACM SIGACT Symposium on Theory of Computing, STOC 2018, p.575
, , p.576, 2018.
Optimal parameterized algorithms for planar facil-578 ity location problems using voronoi diagrams, Algorithms -ESA 2015 -23rd An-579 ,
, nual European Symposium, vol.23, p.15, 2015.
, , pp.865-877, 2015.
Optimal terminal dimensionality reduction in euclidean 583 space, vol.584 ,
A constant parameterized approximation for hard-586 capacitated k-means, 2019. ,