Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms, 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, pp.61-72, 2017. ,
The Hardness of Approximation of Euclidean k-Means, 31st International Symposium on Computational Geometry, pp.754-767, 2015. ,
An improved approximation for k-median, and positive correlation in budgeted optimization, Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pp.737-756, 2014. ,
Maximizing a monotone submodular function subject to a matroid constraint, SIAM J. Comput, vol.40, issue.6, pp.1740-1766, 2011. ,
From gap-ETH to FPT-inapproximability: Clique, dominating set, and more, Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on, pp.743-754, 2017. ,
A Constant-Factor Approximation Algorithm for the k-Median Problem, J. Comput. Syst. Sci, vol.65, issue.1, pp.129-149, 2002. ,
On k-Median clustering in high dimensions, SODA, 2006. ,
On coresets for k-median and k-means clustering in metric and Euclidean spaces and their applications, SIAM Journal on Computing, vol.39, issue.3, pp.923-947, 2009. ,
The constant inapproximability of the parameterized dominating set problem, Foundations of Computer Science (FOCS), 2016 IEEE 57th Annual Symposium on, pp.505-514, 2016. ,
On the parameterized complexity of approximating dominating set, Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp.1283-1296, 2018. ,
Small Space Representations for Metric Min-sum k-Clustering and Their Applications, Theory Comput. Syst, vol.46, issue.3, pp.416-442, 2010. ,
Mildly exponential reduction from gap 3SAT to polynomial-gap label cover, Electronic Colloquium on Computational Complexity (ECCC), pp.16-128, 2016. ,
A Threshold of Ln N for Approximating Set Cover, J. ACM, vol.45, issue.4, 1998. ,
A Unified Framework for Approximating and Clustering Data. CoRR, abs/1106.1379, STOC 11), 2011. ,
Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering, Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pp.1434-1453, 2013. ,
Greedy strikes back: improved facility location algorithms, J. Algorithms, vol.31, issue.1, pp.228-248, 1999. ,
A local search approximation algorithm for k-means clustering, Comput. Geom, vol.28, issue.2-3, pp.89-112, 2004. ,
Facility Location with Matroid or Knapsack Constraints, Math. Oper. Res, vol.40, issue.2, pp.446-459, 2015. ,
Linear-time approximation schemes for clustering problems in any dimensions, J. ACM, vol.57, issue.2, 2010. ,
Improved and simplified inapproximability for k-means, Inf. Process. Lett, vol.120, pp.40-43, 2017. ,
A 1.488 approximation algorithm for the uncapacitated facility location problem, Information and Computation, vol.222, pp.45-58, 2013. ,
URL : https://hal.archives-ouvertes.fr/in2p3-00420482
Approximating k-Median via Pseudo-Approximation, SIAM J. Comput, vol.45, issue.2, pp.530-547, 2016. ,
The parameterized complexity of k-biclique, Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pp.605-615 ,
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs, 44th International Colloquium on Automata, Languages, and Programming, vol.80, p.15, 2017. ,
A parallel repetition theorem, SIAM Journal on Computing, vol.27, issue.3, pp.763-803, 1998. ,
Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications, ACM Trans. Algorithms, vol.12, issue.4, 2016. ,