Author of the publication

Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection.

, , , , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 3121-3132. PMLR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Online make-to-order joint replenishment model: primal dual competitive algorithms., , , , and . SODA, page 952-961. SIAM, (2008)Local Search is Better than Random Assignment for Bounded Occurrence Ordering k-CSPs.. STACS, volume 20 of LIPIcs, page 139-147. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)Performance of Johnson-Lindenstrauss transform for k-means and k-medians clustering., , and . STOC, page 1027-1038. ACM, (2019)Bisect and Conquer: Hierarchical Clustering via Max-Uncut Bisection., , , , , , and . AISTATS, volume 108 of Proceedings of Machine Learning Research, page 3121-3132. PMLR, (2020)How to Play Unique Games on Expanders., and . WAOA, volume 6534 of Lecture Notes in Computer Science, page 190-200. Springer, (2010)Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!, and . CoRR, (2023)Robust algorithms with polynomial loss for near-unanimity CSPs., , , , , and . SODA, page 340-357. SIAM, (2017)Approximation Algorithm for Sparsest k-Partitioning., and . SODA, page 1244-1255. SIAM, (2014)Two-Sided Kirszbraun Theorem., , , and . SoCG, volume 189 of LIPIcs, page 13:1-13:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Explainable k-means: don't be greedy, plant bigger trees!, and . STOC, page 1629-1642. ACM, (2022)