Subgraph sparsification and nearly optimal ultrasparsifiers
From MaRDI portal
Publication:2875132
DOI10.1145/1806689.1806699zbMath1293.05370MaRDI QIDQ2875132
Alexandra Kolla, Yury Makarychev, Amin Saberi, Shang-Hua Teng
Publication date: 13 August 2014
Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1806689.1806699
68W40: Analysis of algorithms
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
A Local Search Framework for Experimental Design, A Spectral Approach to Network Design, A General Framework for Graph Sparsification, Unnamed Item, Advances in metric embedding theory, Extracting a basis with fixed block inside a matrix, An approximation algorithm for the maximum spectral subgraph problem