Semidefinite Programming Based Algorithms for the Sparsest Cut Problem

DOI10.1051/RO/2011104zbMath1270.90091OpenAlexW2118059629MaRDI QIDQ4917216

Luis A. A. Meira, Flávio K. Miyazawa

Publication date: 29 April 2013

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2011104

zbMATH Keywords

combinatoricssemidefinite programmingsparsest cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• SDPA

This page was built for publication: Semidefinite Programming Based Algorithms for the Sparsest Cut Problem