Imagen de Portada

Semi-Streaming Algorithms for Hypergraph Matching

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Reinstädtler, Henrik, Ferdous, S M, Pothen, Alex, Uçar, Bora, Schulz, Christian
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

Semi-Streaming Algorithms for Weighted $k$-Disjoint Matchings
por: Ferdous, S M, et al.
Publicado: (2023)

Engineering Hypergraph $b$-Matching Algorithms
por: Großmann, Ernestine, et al.
Publicado: (2024)

Efficient Parallel Algorithms for Hypergraph Matching
por: Reinstädtler, Henrik, et al.
Publicado: (2026)

Engineering Edge Orientation Algorithms
por: Reinstädtler, H., et al.
Publicado: (2024)

Weighted Matching in a Poly-Streaming Model
por: Ullah, Ahammed, et al.
Publicado: (2025)

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

Engineering Fully Dynamic Exact $Δ$-Orientation Algorithms
por: Großmann, Ernestine, et al.
Publicado: (2024)

Succinct Graph Representations and Algorithmic Applications
por: Ullah, Ahammed, et al.
Publicado: (2026)

From Theory to Practice: Engineering Approximation Algorithms for Dynamic Orientation
por: Großmann, Ernestine, et al.
Publicado: (2025)

GreedyML: A Parallel Algorithm for Maximizing Constrained Submodular Functions
por: Gopal, Shivaram, et al.
Publicado: (2024)

Engineering Fully Dynamic Convex Hulls
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Approximate Bipartite $b$-Matching using Multiplicative Auction
por: Samineni, Bhargav, et al.
Publicado: (2024)

Data Reductions for the Strong Maximum Independent Set Problem in Hypergraphs
por: Großmann, Ernestine, et al.
Publicado: (2026)

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

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
por: Buchbinder, Niv, et al.
Publicado: (2026)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

Semi-Robust Communication Complexity of Maximum Matching
por: Huete, Gabriel Cipriani, et al.
Publicado: (2025)

Buffered Streaming Edge Partitioning
por: Chhabra, Adil, et al.
Publicado: (2024)

Semi-Streaming Algorithms for Graph Property Certification
por: Das, Avinandan, et al.
Publicado: (2025)

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

Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
por: Flin, Maxime, et al.
Publicado: (2026)

Deterministic $(1+\varepsilon)$-Approximate Maximum Matching with $\mathsf{poly}(1/\varepsilon)$ Passes in the Semi-Streaming Model and Beyond
por: Fischer, Manuela, et al.
Publicado: (2021)

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

Efficient Hypergraph Pattern Matching via Match-and-Filter and Intersection Constraint
por: Song, Siwoo, et al.
Publicado: (2025)

Improved Approximation Algorithms for (1,2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
por: Alipour, Sharareh, et al.
Publicado: (2025)

Overlapping and Robust Edge-Colored Clustering in Hypergraphs
por: Crane, Alex, et al.
Publicado: (2023)

Triangle Counting in Hypergraph Streams: A Complete and Practical Approach
por: Meng, Lingkai, et al.
Publicado: (2025)

A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching
por: Assadi, Sepehr
Publicado: (2023)

Disjoint Paths in Expanders in Deterministic Almost-Linear Time via Hypergraph Perfect Matching
por: Bucić, Matija, et al.
Publicado: (2025)

Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)

Streaming Algorithms for Connectivity Augmentation
por: Jin, Ce, et al.
Publicado: (2024)

Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $Δ$-Coloring
por: Assadi, Sepehr, et al.
Publicado: (2022)

Online Matching on $3$-Uniform Hypergraphs
por: Borst, Sander, et al.
Publicado: (2024)

Algorithms for Parameterized String Matching with Mismatches
por: Saha, Apurba, et al.
Publicado: (2024)

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
por: Borowitz, Jannick, et al.
Publicado: (2023)

Faster Semi-streaming Matchings via Alternating Trees
por: Mitrović, Slobodan, et al.
Publicado: (2024)

Streaming Algorithms with Few State Changes
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Streaming Algorithms for Geometric Steiner Forest
por: Czumaj, Artur, et al.
Publicado: (2020)

Near-optimal Linear Sketches and Fully-Dynamic Algorithms for Hypergraph Spectral Sparsification
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
por: Saxena, Raghuvansh R., et al.
Publicado: (2024)