Fast approximation algorithms for the diameter and radius of sparse graphs

Liam Roditty, Virginia Vassilevska Williams. Fast approximation algorithms for the diameter and radius of sparse graphs. In Dan Boneh, Tim Roughgarden, Joan Feigenbaum, editors, Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013. pages 515-524, ACM, 2013. [doi]

@inproceedings{RodittyW13,
  title = {Fast approximation algorithms for the diameter and radius of sparse graphs},
  author = {Liam Roditty and Virginia Vassilevska Williams},
  year = {2013},
  doi = {10.1145/2488608.2488673},
  url = {http://doi.acm.org/10.1145/2488608.2488673},
  researchr = {https://researchr.org/publication/RodittyW13},
  cites = {0},
  citedby = {0},
  pages = {515-524},
  booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013},
  editor = {Dan Boneh and Tim Roughgarden and Joan Feigenbaum},
  publisher = {ACM},
  isbn = {978-1-4503-2029-0},
}