Reduction from CNF-SAT to Approximate Reach Centrality
Revision as of 10:55, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: CNF-SAT TO: Approximate Reach Centrality == Description == $\alpha$-approximation for any finite $\alpha$ (possibly depending on $m$) == Implications == if: to-time: $O(m^{2-\epsilon})$ for some $\epsilon > {0}$<br/>then: from-time: $O*({2}^{({1}-\delta)n})$ for some $\delta > {0}$ == Year == 2015 == Reference == Amir Abboud, Fabrizio Grandoni, and Virginia Vassilevska Williams. Subcubic equivalences between graph centrality problems, APSP and d...")
FROM: CNF-SAT TO: Approximate Reach Centrality
Description
$\alpha$-approximation for any finite $\alpha$ (possibly depending on $m$)
Implications
if: to-time: $O(m^{2-\epsilon})$ for some $\epsilon > {0}$
then: from-time: $O*({2}^{({1}-\delta)n})$ for some $\delta > {0}$
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, Corollary 4.2