Author of the publication

Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets.

, , , and . STOC, page 1621-1628. ACM, (2022)

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 information-theoretic lower bounds for welfare maximization in combinatorial auctions., , and . EC, page 70-77. ACM, (2008)Connected Components in MapReduce and Beyond., , , , and . SoCC, page 18:1-18:13. ACM, (2014)Large-Scale Community Detection on YouTube for Topic Discovery and Exploration., , , and . ICWSM, The AAAI Press, (2011)Tight and Robust Private Mean Estimation with Few Users., , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 16383-16412. PMLR, (2022)Regularized Online Allocation Problems: Fairness and Beyond., , and . ICML, volume 139 of Proceedings of Machine Learning Research, page 630-639. PMLR, (2021)On spectrum sharing games., , , and . PODC, page 107-114. ACM, (2004)Robust Auction Design in the Auto-bidding World., , , , and . NeurIPS, page 17777-17788. (2021)Dynamic Incentive-Aware Learning: Robust Pricing in Contextual Auctions., , and . NeurIPS, page 9756-9766. (2019)Distributed Graph Algorithmics: Theory and Practice., and . WSDM, page 419-420. ACM, (2015)On the Non-progressive Spread of Influence through Social Networks., , , , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 315-326. Springer, (2012)