Approximating Non-Uniform Sparsest Cut via Generalized Spectra

DOI10.1137/1.9781611973105.22zbMath1423.90223arXiv1112.4109OpenAlexW2952056253MaRDI QIDQ5741730

Ali Kemal Sinop, Venkatesan Guruswami

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.4109

Mathematics Subject Classification ID

Semidefinite programming (90C22) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Approximation algorithms (68W25)

Related Items (2)

A unified view of graph regularity via matrix decompositions ⋮ Unnamed Item

This page was built for publication: Approximating Non-Uniform Sparsest Cut via Generalized Spectra