A Mixed Integer Model for the Sparsest Cut problem

DOI10.1016/j.endm.2010.05.015zbMath1237.90172OpenAlexW1976196087MaRDI QIDQ2883559

Eric Gourdin

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.015

zbMATH Keywords

sparsest cutmaximum concurrent flowmixed integer models

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Sparsest cuts and bottlenecks in graphs
• Multicommodity flows in planar graphs
• Improved approximations for the minimum-cut ratio and the flux
• Improved bounds on the max-flow min-cut ratio for multicommodity flows
• Approximate max-flow min-(multi)cut theorems and their applications
• A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows

This page was built for publication: A Mixed Integer Model for the Sparsest Cut problem