Near-linear size hypergraph cut sparsifiers

DOI10.1109/FOCS46700.2020.00015MaRDI QIDQ6944042zbMATH OpenFDO

Authors Sanjeev Khanna, Yu Chen

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00015

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(7)

• Splitting-off in hypergraphs
• Almost-tight bounds on preserving cuts in classes of submodular hypergraphs
• Cut sparsification and succinct representation of submodular hypergraphs
• Splitting-off in hypergraphs
• Vertex sparsifiers for hyperedge connectivity
• Sublinear time hypergraph sparsification via cut and edge sampling queries
• Hypergraph connectivity augmentation in strongly polynomial time

This page was built for publication: Near-linear size hypergraph cut sparsifiers

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