Hacker News new | ask | show | jobs
Multiplicative weights or how to approximate maxflow with O(log n) Dijkstras (zuza.github.io)
2 points by zuzatm 2359 days ago