Jonah Sherman. Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA. pages 363-372, IEEE Computer Society, 2009. [doi]
Abstract is missing.