The Bane of Low-Dimensionality Clustering.
Autorzy:
Cohen-Addad, de Mesmay, Rotenberg, and Roytman.
Opublikowane w:
Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Wydawca:
ACM-SIAM
Hierarchical Clustering: Objective Functions and Algorithms.
Autorzy:
Cohen-Addad, Kanade, Mallmann-Trenn, and Mathieu.
Opublikowane w:
Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Wydawca:
ACM-SIAM
A Fast Approximation Scheme for Low-Dimensional k-Means
Autorzy:
Cohen-Addad
Opublikowane w:
Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Wydawca:
ACM-SIAM
A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals.
Autorzy:
Cohen-Addad, Colin de Verdière and de Mesmay.
Opublikowane w:
Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Wydawca:
ACM-SIAM
Hierarchical Clustering Beyond the Worst-Case.
Autorzy:
Cohen-Addad, Kanade, Mallmann-Trenn.
Opublikowane w:
Proceedings of the Conference on Neural Information Processing Systems (NIPS) 2017., 2017
Wydawca:
MIT Press and Morgan Kaufmann Publishers
Fast and Compact Exact Distance Oracle for Planar Graphs.
Autorzy:
Cohen-Addad, Dahlgaard, and Wulff-Nilsen.
Opublikowane w:
Proceedings of the Symposium on Foundations of Computer Science (FOCS) 2017., 2017
Wydawca:
IEEE
On the Local Structure of Stable Clustering Instances.
Autorzy:
Cohen-Addad, Schwiegelshohn.
Opublikowane w:
Proceedings of the Symposium on Foundations of Computer Science (FOCS) 2017., 2017
Wydawca:
IEEE
