View source for Reduction from Approximate Betweenness Centrality to Diameter

FROM: [[Approximate Betweenness Centrality]] TO: [[Diameter]]

== Description == 

$\alpha$-approximation with $\alpha > 1$

== Implications == 



== Year == 

2015

== Reference == 

Amir Abboud, Fabrizio Grandoni, and Virginia Vassilevska Williams. Subcubic equivalences between graph centrality problems, APSP and diameter. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 1681–1697, 2015.

https://epubs.siam.org/doi/10.1137/1.9781611973730.112, Theorem 4.2