O(p log n) approximation to sparsest cut iñ o(n 2 ) time, Proceedings 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pp.238-247, 2004. ,
Geometry, flows, and graph-partitioning algorithms, Communications of the ACM, vol.51, issue.10, pp.96-105, 2008. ,
DOI : 10.1145/1400181.1400204
Minimizing Routing Energy Consumption: From Theoretical to Practical Results, 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing, p.8, 2010. ,
DOI : 10.1109/GreenCom-CPSCom.2010.147
URL : https://hal.archives-ouvertes.fr/hal-00531468
Graph partitioning using single commodity flows, Proceedings of the 38th annual ACM symposium on Theory of computing (STOC'06), pp.385-390, 2006. ,
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, Journal of the ACM, vol.46, issue.6, pp.787-832, 1999. ,
DOI : 10.1145/331524.331526
SNDlib 1.0-Survivable Network Design Library, Networks, vol.3, issue.3, pp.276-286, 2010. ,
DOI : 10.1002/net.20371
Approximation Algorithms for NP-hard Problems, chapter 5 : [Approximation algorithms for] Cut problems and their application to divide-and-conquer, pp.192-235, 1997. ,