%0 Journal Article %1 leighton1999multicommodity %A Leighton, Tom %A Rao, Satish %C New York, NY, USA %D 1999 %I ACM %J J. ACM %K clustering conductance graph measure %P 787--832 %R http://doi.acm.org/10.1145/331524.331526 %T Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms %U http://doi.acm.org/10.1145/331524.331526 %V 46

@article{leighton1999multicommodity, acmid = {331526}, added-at = {2011-09-01T15:27:54.000+0200}, address = {New York, NY, USA}, author = {Leighton, Tom and Rao, Satish}, biburl = {https://www.bibsonomy.org/bibtex/250a3cddf12c9c4757f8ebabf95c57128/folke}, doi = {http://doi.acm.org/10.1145/331524.331526}, interhash = {32eccb86182f531f6249910d3b4e5c2c}, intrahash = {50a3cddf12c9c4757f8ebabf95c57128}, issn = {0004-5411}, issue = {6}, journal = {J. ACM}, keywords = {clustering conductance graph measure}, month = {November}, numpages = {46}, pages = {787--832}, publisher = {ACM}, timestamp = {2011-09-01T15:27:54.000+0200}, title = {Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}, url = {http://doi.acm.org/10.1145/331524.331526}, volume = 46, year = 1999 }