Multiplicative weights or how to approximate maxflow with O(log n) Dijkstras | Hacker News Reader