Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs

Aleksander Madry. Fast Approximation Algorithms for Cut-Based Problems in Undirected Graphs. In 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA. pages 245-254, IEEE Computer Society, 2010. [doi]

Abstract

Abstract is missing.