Imagen de Portada

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Khanna, Sanjeev, Li, Huan, Putterman, Aaron
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Near-optimal Hypergraph Sparsification in Insertion-only and Bounded-deletion Streams
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms
por: Assadi, Sepehr, et al.
Publicado: (2025)

A Theory of Spectral CSP Sparsification
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Efficient Algorithms and New Characterizations for CSP Sparsification
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
por: Khanna, Sanjeev, et al.
Publicado: (2024)

Fully Dynamic Spectral Sparsification of Hypergraphs
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fully Dynamic Spectral Sparsification for Directed Hypergraphs
por: Forster, Sebastian, et al.
Publicado: (2025)

An $\widetilde{O} (n^{3/7})$ Round Parallel Algorithm for Matroid Bases
por: Khanna, Sanjeev, et al.
Publicado: (2026)

On the Parallel Complexity of Finding a Matroid Basis
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Fault-Tolerant Distance Oracles Below the $n \cdot f$ Barrier
por: Khanna, Sanjeev, et al.
Publicado: (2026)

A Faster Deterministic Algorithm for Fully Dynamic Maximal Matching
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Optimal Parallel Basis Finding in Graphic and Related Matroids
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
por: Assadi, Sepehr, et al.
Publicado: (2024)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
por: Agarwal, Arpit, et al.
Publicado: (2024)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
por: Kenneth, Yotam, et al.
Publicado: (2023)

Maximum Bipartite Matching in $n^{2+o(1)}$ Time via a Combinatorial Algorithm
por: Chuzhoy, Julia, et al.
Publicado: (2024)

An $n^{2+o(1)}$ Time Algorithm for Single-Source Negative Weight Shortest Paths
por: Khanna, Sanjeev, et al.
Publicado: (2026)

Sketching Cuts in Graphs and Hypergraphs
por: Kogan, Dmitry, et al.
Publicado: (2014)

Structure-Aware Spectral Sparsification via Uniform Edge Sampling
por: He, Kaiwen, et al.
Publicado: (2025)

Quantum Speedup for Hypergraph Sparsification
por: Liu, Chenghua, et al.
Publicado: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Fast and Faithful Edge Bundling using Spectral Sparsification
por: Jiang, Xingjue, et al.
Publicado: (2026)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
por: Kuszmaul, William, et al.
Publicado: (2024)

Faster Spectral Density Estimation and Sparsification in the Nuclear Norm
por: Jin, Yujia, et al.
Publicado: (2024)

Spectral Sparsification by Deterministic Discrepancy Walk
por: Lau, Lap Chi, et al.
Publicado: (2024)

Bootstrapping Dynamic APSP via Sparsification
por: Kyng, Rasmus, et al.
Publicado: (2024)

Eulerian Graph Sparsification by Effective Resistance Decomposition
por: Jambulapati, Arun, et al.
Publicado: (2024)

Fully Dynamic Algorithms for Chamfer Distance
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Transitive Reduction
por: Goranci, Gramoz, et al.
Publicado: (2025)

Linear-Time Multilevel Graph Partitioning via Edge Sparsification
por: Gottesbüren, Lars, et al.
Publicado: (2025)

Fully Dynamic Spectral and Cut Sparsifiers for Directed Graphs
por: Zhao, Yibin
Publicado: (2025)

Streaming Maximal Matching with Bounded Deletions
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Query Complexity of the Metric Steiner Tree Problem
por: Chen, Yu, et al.
Publicado: (2022)

Adaptive Sparsification for Linear Programming
por: Objois, Étienne, et al.
Publicado: (2025)

Simple Algorithms for Fully Dynamic Edge Connectivity
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

Simpler O(1) Query Algorithm for Level Ancestors
por: Saxena, Sanjeev
Publicado: (2022)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
por: Chhabra, Adil, et al.
Publicado: (2025)

Near-optimal Algorithms for Stochastic Online Bin Packing
por: Ayyadevara, Nikhil, et al.
Publicado: (2022)