Polynomiality of sparsest cuts with fixed number of sources

DOI10.1016/J.ORL.2006.12.011zbMATH Open1163.90712OpenAlexW2166796664MaRDI QIDQ2467444FDOQ2467444

Authors: Sung-Pil Hong, Byung-Cheon Choi 

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)

Cites Work

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

Cited In (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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467444)