Massively Parallel and Dynamic Algorithms for Minimum Size Clustering

Alessandro Epasto, Mohammad Mahdian, Vahab S. Mirrokni, Peilin Zhong. Massively Parallel and Dynamic Algorithms for Minimum Size Clustering. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 1613-1660, SIAM, 2022. [doi]

@inproceedings{EpastoMMZ22,
  title = {Massively Parallel and Dynamic Algorithms for Minimum Size Clustering},
  author = {Alessandro Epasto and Mohammad Mahdian and Vahab S. Mirrokni and Peilin Zhong},
  year = {2022},
  doi = {10.1137/1.9781611977073.66},
  url = {https://doi.org/10.1137/1.9781611977073.66},
  researchr = {https://researchr.org/publication/EpastoMMZ22},
  cites = {0},
  citedby = {0},
  pages = {1613-1660},
  booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
  editor = {Joseph (Seffi) Naor and Niv Buchbinder},
  publisher = {SIAM},
  isbn = {978-1-61197-707-3},
}