Online algorithms for spectral hypergraph sparsification

DOI10.1007/978-3-031-59835-7_30MaRDI QIDQ7030545zbMATH OpenFDO

Authors Tasuku Soma, Kam Chuen Tung, Yuichi Yoshida

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-59835-7_30

zbMATH Keywords

generic chaininghypergraph sparsificationonline algorithmsspectral algorithms

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Programming involving graphs or networks (90C35)

Cites work

• Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph Sparsification
• Concentration Inequalities and Martingale Inequalities: A Survey
• Graph sparsification by effective resistances
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Lx = b
• Nearly tight spectral sparsification of directed hypergraphs
• New notions and constructions of sparsification for graphs and hypergraphs
• Online row sampling
• Single pass spectral sparsification in dynamic streams
• Sparsifying sums of norms
• Spectral hypergraph sparsification via chaining
• Spectral hypergraph sparsifiers of nearly linear size
• Spectral properties of hypergraph Laplacian and approximation algorithms
• Spectral sparsification in the semi-streaming setting
• Spectral sparsification of graphs
• Spectral sparsification of hypergraphs
• Towards tight bounds for spectral sparsification of hypergraphs
• Upper and lower bounds for stochastic processes. Modern methods and classical problems

This page was built for publication: Online algorithms for spectral hypergraph sparsification

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