The Communication Complexity of Optimization

DOI10.1137/1.9781611975994.106OpenAlexW3002117425MaRDI QIDQ5146886

David P. Woodruff, Ruosong Wang, Santosh Vempala

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.05832

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Communication-efficient distributed graph clustering and sparsification under duplication models

This page was built for publication: The Communication Complexity of Optimization