Nearly tight spectral sparsification of directed hypergraphs

DOI10.4230/LIPICS.ICALP.2023.94MaRDI QIDQ6638099zbMATH OpenFDO

Authors Kazusato Oko, Shinsaku Sakaue, Shin-Ichi Tanigawa

Publication date 14 November 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2023.94

zbMATH Keywords

(directed) hypergraphsiterative samplingspectral sparsification

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(4)

• Almost-tight bounds on preserving cuts in classes of submodular hypergraphs
• Cut sparsification and succinct representation of submodular hypergraphs
• Online algorithms for spectral hypergraph sparsification
• Online algorithms for spectral hypergraph sparsification

This page was built for publication: Nearly tight spectral sparsification of directed hypergraphs

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