1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DS2024★ 1 cited
Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
Sanjeev Khanna, Aaron L. Putterman, Madhu Sudan
A -sparsifier of a hypergraph is a (weighted) subgraph that preserves the value of every cut to within a -factor. It is known that every hypergraph w…
cs.DS2024
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
Sanjeev Khanna, Aaron L. Putterman, Madhu Sudan
Recently, a number of variants of the notion of cut-preserving hypergraph sparsification have been studied in the literature. These variants include directed hypergraph sparsificat…
cs.DS2023
Code Sparsification and its Applications
Sanjeev Khanna, Aaron L Putterman, Madhu Sudan
We introduce a notion of code sparsification that generalizes the notion of cut sparsification in graphs. For a (linear) code of dimension $k…