On the hardness of approximating multicut and sparsest-cut, (2006)

by S Chawla, R Krauthgamer, R Kumar, Y Rabani, D Sivakumar
Venue:Computational Complexity