Skip to main content
European Commission logo print header

Provably-Correct Efficient Algorithms for Clustering

Publications

The Bane of Low-Dimensionality Clustering.

Author(s): Cohen-Addad, de Mesmay, Rotenberg, and Roytman.
Published in: Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Publisher: ACM-SIAM

Hierarchical Clustering: Objective Functions and Algorithms.

Author(s): Cohen-Addad, Kanade, Mallmann-Trenn, and Mathieu.
Published in: Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Publisher: ACM-SIAM

A Fast Approximation Scheme for Low-Dimensional k-Means

Author(s): Cohen-Addad
Published in: Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Publisher: ACM-SIAM

A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs with a Fixed Number of Terminals.

Author(s): Cohen-Addad, Colin de Verdière and de Mesmay.
Published in: Proceedings of the Symposium on Discrete Algorithms (SODA) 2018., 2018
Publisher: ACM-SIAM

Hierarchical Clustering Beyond the Worst-Case.

Author(s): Cohen-Addad, Kanade, Mallmann-Trenn.
Published in: Proceedings of the Conference on Neural Information Processing Systems (NIPS) 2017., 2017
Publisher: MIT Press and Morgan Kaufmann Publishers

Fast and Compact Exact Distance Oracle for Planar Graphs.

Author(s): Cohen-Addad, Dahlgaard, and Wulff-Nilsen.
Published in: Proceedings of the Symposium on Foundations of Computer Science (FOCS) 2017., 2017
Publisher: IEEE

On the Local Structure of Stable Clustering Instances.

Author(s): Cohen-Addad, Schwiegelshohn.
Published in: Proceedings of the Symposium on Foundations of Computer Science (FOCS) 2017., 2017
Publisher: IEEE

Searching for OpenAIRE data...

There was an error trying to search data from OpenAIRE

No results available