O(root log n) APPROXIMATION TO SPARSEST CUT IN (O)over-bar(n(2)) TIME
[PdwhPubMemberDTO{psnId=null, seqNo=1, name='Arora Sanjeev', email='null', communicable='true', dept='null', firstAuthor=true}, PdwhPubMemberDTO{psnId=null, seqNo=2, name='Hazan Elad', email='null', communicable='false', dept='null', firstAuthor=false}, PdwhPubMemberDTO{psnId=null, seqNo=3, name='Kale Satyen', email='null', communicable='false', dept='null', firstAuthor=false}]
SIAM Journal on Computing, 2010, 39(5): 1748-1771.