scientific article; zbMATH DE number 7768364

DOI10.4230/LIPICS.APPROX/RANDOM.2021.19MaRDI QIDQ6090893zbMATH OpenFDO

Authors Christian Konrad

Publication date 20 November 2023

Full work available at URL https://arxiv.org/abs/2107.07841

zbMATH Keywords

data streaminglower boundsmatchings

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cited in

(11)

• Approximate Maximum Matching in Random Streams
• scientific article; zbMATH DE number 7053293 (Why is no real title available?)
• Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model
• On regularity lemma and barriers in streaming and dynamic matching
• A simple (1-)-approximation semi-streaming algorithm for maximum (weighted) matching
• Weighted matching in the random-order streaming and robust communication models
• Dynamic matching with better-than-2 approximation in polylogarithmic update time
• Matchings in low-arboricity graphs in the dynamic graph stream model
• Constructing long paths in graph streams
• Streaming maximal matching with bounded deletions
• A 0.51-approximation of maximum matching in sublinear \(n^{1.5}\) time

This page was built for publication:

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