D.: On the hardness of approximating multicut and sparsest-cut (2006)

by S Chawla, R Krauthgamer, R Kumar, Y Rabani, Sivakumar
Venue:Comput. Complexity