Vincent Cohen-Addad
Vincent Cohen-Addad
Google Research (former CNRS & Sorbonne Université)
Bekræftet mail på lip6.fr - Startside
Titel
Citeret af
Citeret af
År
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
1042019
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
902019
Steinberg's conjecture is false
V Cohen-Addad, M Hebdige, Z Li, E Salgado
Journal of Combinatorial Theory, Series B 122, 452-456, 2017
432017
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
312017
Effectiveness of local search for geometric optimization
V Cohen-Addad, C Mathieu
31st International Symposium on Computational Geometry (SoCG 2015), 2015
30*2015
Hierarchical clustering beyond the worst-case
V Cohen-Addad, VN Kanade, F Mallmann-Trenn
Neural Information Processing Systems, 2018
282018
Fast and compact exact distance oracle for planar graphs
V Cohen-Addad, S Dahlgaard, C Wulff-Nilsen
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
282017
Energy-efficient algorithms for non-preemptive speed-scaling
V Cohen-Addad, Z Li, C Mathieu, I Milis
International Workshop on Approximation and Online Algorithms, 107-118, 2014
272014
Balanced centroidal power diagrams for redistricting
V Cohen-Addad, PN Klein, NE Young
Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances …, 2018
24*2018
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
232016
Tight FPT Approximations for -Median and -Means
V Cohen-Addad, A Gupta, A Kumar, E Lee, J Li
arXiv preprint arXiv:1904.12334, 2019
182019
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
172019
A Fast Approximation Scheme for Low-Dimensional k-Means
V Cohen-Addad
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
172018
Online optimization of smoothed piecewise constant functions
V Cohen-Addad, V Kanade
Artificial Intelligence and Statistics, 412-420, 2017
162017
On the fixed-parameter tractability of capacitated clustering
V Cohen-Addad, J Li
46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019
132019
Diameter and k-center in sliding windows
V Cohen-Addad, C Schwiegelshohn, C Sohler
43rd International Colloquium on Automata, Languages, and Programming (ICALP …, 2016
132016
Fully dynamic consistent facility location
V Cohen-Addad, N Hjuler, N Parotsidis, D Saulpic, C Schwiegelshohn
NeurIPS'19-33rd Conference on Neural Information Processing Systems, 2019
122019
Approximating connectivity domination in weighted bounded-genus graphs
V Cohen-Addad, É Colin de Verdière, PN Klein, C Mathieu, ...
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
122016
Inapproximability of clustering in lp metrics
V Cohen-Addad, CS Karthik
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
102019
The bane of low-dimensionality clustering
V Cohen-Addad, A De Mesmay, E Rotenberg, A Roytman
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
82018
Systemet kan ikke foretage handlingen nu. Prøv igen senere.
Artikler 1–20