%0 Journal Article %1 Leighton99multicommodityApproximation %A Leighton, Tom %A Rao, Satish %C New York, NY, USA %D 1999 %I ACM %J J. ACM %K 99 Leighton approximation clustering graph max-flow min-cut multicommodity theory %N 6 %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://portal.acm.org/citation.cfm?id=331526 %V 46

@article{Leighton99multicommodityApproximation, added-at = {2008-10-27T21:19:28.000+0100}, address = {New York, NY, USA}, author = {Leighton, Tom and Rao, Satish}, biburl = {https://www.bibsonomy.org/bibtex/22d7036b213a9a86ae91619f9ef33c15f/lee_peck}, description = {Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}, doi = {http://doi.acm.org/10.1145/331524.331526}, interhash = {32eccb86182f531f6249910d3b4e5c2c}, intrahash = {2d7036b213a9a86ae91619f9ef33c15f}, issn = {0004-5411}, journal = {J. ACM}, keywords = {99 Leighton approximation clustering graph max-flow min-cut multicommodity theory}, number = 6, pages = {787--832}, publisher = {ACM}, timestamp = {2009-02-04T16:57:01.000+0100}, title = {Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms}, url = {http://portal.acm.org/citation.cfm?id=331526}, volume = 46, year = 1999 }