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]

Possibly Related Publications

The following publications are possibly variants of this publication: