Jonah Sherman. Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut. In 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA. pages 363-372, IEEE Computer Society, 2009. [doi]
@inproceedings{Sherman09-0,
title = {Breaking the Multicommodity Flow Barrier for O(vlog n)-Approximations to Sparsest Cut},
author = {Jonah Sherman},
year = {2009},
doi = {10.1109/FOCS.2009.66},
url = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2009.66},
researchr = {https://researchr.org/publication/Sherman09-0},
cites = {0},
citedby = {0},
pages = {363-372},
booktitle = {50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA},
publisher = {IEEE Computer Society},
isbn = {978-0-7695-3850-1},
}