Reduction from MAX-CNF-SAT to All-Pairs Maximum Flow

FROM: MAX-CNF-SAT TO: All-Pairs Maximum Flow

Implications

assume: SETH
then: for any fixed constants $\epsilon > {0}$, $c_1,c_2 \in ({0},{1})$, on graphs with $n$ nodes $|S|=\tilde{\Theta}(n^{c_1})$, $|T|=\tilde{\Theta(n^{c_2})}$, $m=O(n)$ edges, and capacaties in $\{1,\cdots,n\}$, target cannot be solved in $O((|S|T|m)^{1-\epsilon})$

Year

2018

Reference

Krauthgamer, R., & Trabelsi, O. (2018). Conditional lower bounds for all-pairs max-flow. ACM Transactions on Algorithms (TALG), 14(4), 1-15.

https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.1145/3212510