Breaking the multicommodity flow barrier for o(√log n)-approximations to sparsest cut | IEEE Conference Publication | IEEE Xplore