A mixed integer model for the sparsest cut problem

Electronic Notes in Discrete Mathematics

Volumn 36, Issue C, 2010, Pages 111-118

  Gourdin, Eric ^a  

^a ORANGE LABS   (France)

Author keywords

Maximum Concurrent Flow; Mixed Integer Models; Sparsest Cut

Indexed keywords

EID: 77954945359     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2010.05.015     Document Type: Article

References (11)

1. Auman Y., Rabani Y. Approximate min-cut max-flow theorem and approximations algorithm. SIAM Journal on Computing 1998, 27:213-238.
2. Bienstock, D., Potential function methods for approximatively solving linear programs: theory and practice, Technical report, CORE Lecture Series Monograph (2001).
3. Günlük O. On the min-cut max-flow ratio for multicommodity flows. SIAM J. of Disc. Math. 2007, 21:1-15.
4. Leighton T., Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. JACM 1999, 46:215-245.
5. Matula, D. and F. Shahrokhi, The maximum concurrent flow problem and sparsest cuts, Technical report, Southern Methodist Univ. Dallas (1986).
6. Matula D., Shahrokhi F. Sparsest cuts and bottlenecks in graphs. Discrete Applied Maths. 1990, 27:113-123.
7. N. Garg, M. Y., V. Vazirani, Approximate max-flow min-(multi)cut theorems and their applications, in: STOC'93, 1993, pp. 698-707.
8. Okamura H., Seymour P. Multicommodity flows in planar graphs. J. Combin. Theory, Ser. B 1981, 31:75-81.
9. S. Plotkin, E. T., Improved bounds on the max-flow min-cut ratio for multicommodity flows, in: 25th Symposium on Theory of Computing, 1993.
10. Schrijver A. Homotopic routing methods. Paths Flows and VLSI-Layout 1990, 329-334. Springer. H.P.B. Korte, L. Lovász, A. Schrijver (Eds.).
11. Tragoudas S. Improved approximations for the min-cut max-flow ratio and the flux. Mathematical Systems Theory 1996, 29:157-167.