The Communication Complexity of Distributed epsilon-Approximations

Zengfeng Huang, Ke Yi. The Communication Complexity of Distributed epsilon-Approximations. In 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014. pages 591-600, IEEE Computer Society, 2014. [doi]

@inproceedings{HuangY14-17,
  title = {The Communication Complexity of Distributed epsilon-Approximations},
  author = {Zengfeng Huang and Ke Yi},
  year = {2014},
  doi = {10.1109/FOCS.2014.69},
  url = {http://dx.doi.org/10.1109/FOCS.2014.69},
  researchr = {https://researchr.org/publication/HuangY14-17},
  cites = {0},
  citedby = {0},
  pages = {591-600},
  booktitle = {55th IEEE  Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014},
  publisher = {IEEE Computer Society},
  isbn = {978-1-4799-6517-5},
}