Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders
From MaRDI portal
Publication:4575689
DOI10.1137/1.9781611974331.ch105zbMath1409.68208arXiv1510.05137OpenAlexW1814356831MaRDI QIDQ4575689
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.05137
Random graphs (graph-theoretic aspects) (05C80) Semidefinite programming (90C22) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
This page was built for publication: Integrality Gaps and Approximation Algorithms for Dispersers and Bipartite Expanders