Sparsifying sums of norms

DOI10.1109/FOCS57990.2023.00119MaRDI QIDQ6942846zbMATH OpenFDO

Authors Arun Jambulapati, James R. Lee, Yang P. Liu, Aaron Sidford

Publication date 15 August 2025

Full work available at URL https://doi.org/10.1109/FOCS57990.2023.00119

Mathematics Subject Classification ID

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

Cited in

(5)

• Cut sparsification and succinct representation of submodular hypergraphs
• Online algorithms for spectral hypergraph sparsification
• Nearly-tight bounds for flow sparsifiers in quasi-bipartite graphs
• Computing Lewis Weights to High Precision by Fixed-Point Iteration
• Cut-preserving vertex sparsifiers for planar and quasi-bipartite graphs

This page was built for publication: Sparsifying sums of norms

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