Obserwuj
Vincent Cohen-Addad
Vincent Cohen-Addad
Google Research (former CNRS & Sorbonne Université)
Zweryfikowany adres z lip6.fr - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Hierarchical clustering: Objective functions and algorithms
V Cohen-Addad, V Kanade, F Mallmann-Trenn, C Mathieu
Journal of the ACM (JACM) 66 (4), 1-42, 2019
3452019
Local Search Yields Approximation Schemes for -Means and -Median in Euclidean and Minor-Free Metrics
V Cohen-Addad, PN Klein, C Mathieu
SIAM Journal on Computing 48 (2), 644-667, 2019
1762019
A new coreset framework for clustering
V Cohen-Addad, D Saulpic, C Schwiegelshohn
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
892021
Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma
L Becchetti, M Bury, V Cohen-Addad, F Grandoni, C Schwiegelshohn
Proceedings of the 51st annual ACM SIGACT symposium on theory of computing …, 2019
872019
Tight FPT Approximations for -Median and -Means
V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li
arXiv preprint arXiv:1904.12334, 2019
872019
Steinberg's conjecture is false
V Cohen-Addad, M Hebdige, D Král’, Z Li, E Salgado
Journal of Combinatorial Theory, Series B 122, 452-456, 2017
832017
On the local structure of stable clustering instances
V Cohen-Addad, C Schwiegelshohn
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), 49-60, 2017
652017
On the fixed-parameter tractability of capacitated clustering
V Cohen-Addad, J Li
arXiv preprint arXiv:2208.14129, 2022
622022
Towards optimal lower bounds for k-median and k-means coresets
V Cohen-Addad, KG Larsen, D Saulpic, C Schwiegelshohn
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
612022
Near-linear time approximation schemes for clustering in doubling metrics
V Cohen-Addad, AE Feldmann, D Saulpic
Journal of the ACM (JACM) 68 (6), 1-34, 2021
562021
Hierarchical clustering beyond the worst-case
V Cohen-Addad, V Kanade, F Mallmann-Trenn
Advances in Neural Information Processing Systems 30, 2017
552017
Inapproximability of clustering in lp metrics
V Cohen-Addad, CS Karthik
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
542019
Fully dynamic consistent facility location
V Cohen-Addad, NOD Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn
Advances in Neural Information Processing Systems 32, 2019
532019
Balanced centroidal power diagrams for redistricting
V Cohen-Addad, PN Klein, NE Young
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018
53*2018
Subquadratic high-dimensional hierarchical clustering
A Abboud, V Cohen-Addad, H Houdrouge
Advances in Neural Information Processing Systems 32, 2019
492019
Online k-means clustering
V Cohen-Addad, B Guedj, V Kanade, G Rom
International Conference on Artificial Intelligence and Statistics, 1126-1134, 2021
482021
Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets
V Cohen-Addad, H Esfandiari, V Mirrokni, S Narayanan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
462022
The power of uniform sampling for coresets
V Braverman, V Cohen-Addad, HCS Jiang, R Krauthgamer, ...
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
452022
The invisible hand of dynamic market pricing
V Cohen-Addad, A Eden, M Feldman, A Fiat
Proceedings of the 2016 ACM Conference on Economics and Computation, 383-400, 2016
442016
Effectiveness of local search for geometric optimization
V Cohen-Addad, C Mathieu
31st International Symposium on Computational Geometry (SoCG 2015), 329-344, 2015
44*2015
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20