Polynomiality of sparsest cuts with fixed number of sources

DOI10.1016/j.orl.2006.12.011zbMath1163.90712OpenAlexW2166796664MaRDI QIDQ2467444

Byung-Cheon Choi, Sung-Pil Hong

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.12.011

zbMATH Keywords

sparsest cut problempolynomialityfixed number of sources

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph theory (05C99)

Related Items (2)

Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem ⋮ Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem

Cites Work

• Unnamed Item
• Sparsest cuts and bottlenecks in graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• The maximum concurrent flow problem
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: Polynomiality of sparsest cuts with fixed number of sources