A Mixed Integer Model for the Sparsest Cut problem
References (11)
- et al.
Sparsest cuts and bottlenecks in graphs
Discrete Applied Maths.
(1990) - et al.
Multicommodity flows in planar graphs
J. Combin. Theory, Ser. B
(1981) - et al.
Approximate min-cut max-flow theorem and approximations algorithm
SIAM Journal on Computing
(1998) - Bienstock, D., Potential function methods for approximatively solving linear programs: theory and practice, Technical...
On the min-cut max-flow ratio for multicommodity flows
SIAM J. of Disc. Math.
(2007)
There are more references available in the full text version of this article.
Cited by (1)
Network resilience: A systematic approach
2011, IEEE Communications Magazine
- 1
The work presented in this paper is supported by the European Commission, under Grant No. FP7-224619 (the ResumeNet project)
Copyright © 2010 Elsevier B.V. All rights reserved.