Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, D. Sivakumar. On the Hardness of Approximating Multicut and Sparsest-Cut. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA. pages 144-153, IEEE Computer Society, 2005. [doi]
@inproceedings{ChawlaKKRS05,
title = {On the Hardness of Approximating Multicut and Sparsest-Cut},
author = {Shuchi Chawla and Robert Krauthgamer and Ravi Kumar and Yuval Rabani and D. Sivakumar},
year = {2005},
doi = {10.1109/CCC.2005.20},
url = {http://dx.doi.org/10.1109/CCC.2005.20},
researchr = {https://researchr.org/publication/ChawlaKKRS05},
cites = {0},
citedby = {0},
pages = {144-153},
booktitle = {20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA},
publisher = {IEEE Computer Society},
isbn = {0-7695-2364-1},
}