A Faster Approximation of Maximum Flow in Undirected Graphs

To add some context, this is the paper with all the details that wasn't available when the earlier press release hit HN. The old conversation is here: http://news.ycombinator.com/item?id=1732952