Author of the publication

Hierarchical Clustering: A 0.585 Revenue Approximation.

, , and . COLT, volume 125 of Proceedings of Machine Learning Research, page 153-162. 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

Tight Bounds for Clairvoyant Dynamic Bin Packing., and . SPAA, page 77-86. ACM, (2017)Tight Bounds for Clairvoyant Dynamic Bin Packing., and . ACM Trans. Parallel Comput., 6 (3): 15:1-15:21 (2019)The Min-Cost Matching with Concave Delays Problem., , and . CoRR, (2020)Hierarchical Clustering: A 0.585 Revenue Approximation., , and . COLT, volume 125 of Proceedings of Machine Learning Research, page 153-162. PMLR, (2020)The Price of Clustering in Bin-Packing with Applications to Bin-Packingwith Delays., , , and . SPAA, page 1-10. ACM, (2019)Customization scenarios for de-identification of clinical notes., , , , , , , , , and 9 other author(s). BMC Medical Informatics Decis. Mak., 20 (1): 14 (2020)List Update with Delays or Time Windows., , and . CoRR, (2023)Optimization in Matching and Clustering. Tel Aviv University, Israel, (2023)Tel Aviv University Library.Tree Learning: Optimal Sample Complexity and Algorithms., , , , , and . AAAI, page 6701-6708. AAAI Press, (2023)Multi Layer Peeling for Linear Arrangement and Hierarchical Clustering., and . ICALP, volume 261 of LIPIcs, page 13:1-13:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)