Spectral hypergraph sparsifiers of nearly linear size

DOI10.1109/FOCS52979.2021.00114MaRDI QIDQ6943436zbMATH OpenFDO

Authors Robert Krauthgamer, Jakab Tardos, Michael Kapralov, Yuichi Yoshida

Publication date 13 August 2025

Full work available at URL https://doi.org/10.1109/FOCS52979.2021.00114

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to information and communication theory (94-06)

Cited in

(8)

• Splitting-off in hypergraphs
• Almost-tight bounds on preserving cuts in classes of submodular hypergraphs
• Splitting-off in hypergraphs
• Vertex sparsifiers for hyperedge connectivity
• Online algorithms for spectral hypergraph sparsification
• Online algorithms for spectral hypergraph sparsification
• Hypergraph connectivity augmentation in strongly polynomial time
• Mimicking networks for constrained multicuts in hypergraphs

This page was built for publication: Spectral hypergraph sparsifiers of nearly linear size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943436)