O(√log n) approximation to SPARSEST CUT in Õ(n 2) timeSanjeev Arora,Elad Hazan,Satyen KaleSIAM Journal on Computing(2004)引用 132|浏览3暂无评分AI 理解论文溯源树样例生成溯源树,研究论文发展脉络Chat Paper正在生成论文摘要