Fast approximation algorithms for cut-based problems in undirected graphs (0)

by A Madry
Venue:in Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, ser. FOCS ’10