Sparsest Cut
暂无分享,去创建一个
[1] Sanjeev Arora,et al. Euclidean distortion and the sparsest cut , 2005, STOC '05.
[2] Frank Thomson Leighton,et al. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.
[3] David B. Shmoys,et al. Cut problems and their application to divide-and-conquer , 1996 .
[4] D. Hochbaum. Approximation Algorithms for NP-Hard Problems , 1996 .
[5] Nathan Linial,et al. The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.