Min-max Graph Partitioning and Small Set Expansion

DOI10.1109/FOCS.2011.79zbMath1292.05126MaRDI QIDQ5495004

Nikhil Bansal, Viswanath Nagarajan, Roy Schwartz, Robert Krauthgamer, Konstantin Makarychev, Joseph (Seffi) Naor, Uriel Feige

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Signed and weighted graphs (05C22)

Related Items (8)

Approximation algorithms for the weighted \(t\)-uniform sparsest cut and some other graph partitioning problems ⋮ Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications ⋮ Graph Clustering using Effective Resistance ⋮ On the advantage of overlapping clusters for minimizing conductance ⋮ Approximation Algorithms for CSPs ⋮ Approximating Unique Games Using Low Diameter Graph Decomposition ⋮ Unnamed Item ⋮ Minimum Congestion Mapping in a Cloud

This page was built for publication: Min-max Graph Partitioning and Small Set Expansion