View source for Reduction from CNF-SAT to Approximate Reach Centrality

FROM: [[CNF-SAT]] TO: [[Approximate Reach Centrality]]

== Description == 

$(2-\epsilon)$-approximation in undirected, unweighted graphs for some constant $\epsilon > 0$

== Implications == 

if: to-time: $O(m^{2-\epsilon})$<br/>then: from-time: $O*({2}^{({1}-\epsilon/{2})n})$

== 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.4