Publisher
Springer Nature Switzerland
Reference21 articles.
1. Bansal, N., Svensson, O., Trevisan, L.: New notions and constructions of sparsification for graphs and hypergraphs. In: Proceedings of the IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 910–928 (2019)
2. Batson, J., Spielman, D.A., Srivastava, N., Teng, S.H.: Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8), 87–94 (2013)
3. Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
4. Calandriello, D., Lazaric, A., Valko, M.: Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting. arXiv (2016)
5. Chan, T.H.H., Louis, A., Tang, Z.G., Zhang, C.: Spectral properties of hypergraph laplacian and approximation algorithms. J. ACM 65(3), 1–48 (2018). https://doi.org/10.1145/3178123