Improved bounds for matching in random-order streams

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Superlinear lower bounds for multipass graph processing
Linear programming in the semi-streaming model with application to the maximum matching problem
On graph problems in a semi-streaming model
Maximum Matching in Semi-streaming with Few Passes
Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model
Fully Dynamic Matching in Bipartite Graphs
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
Maximum Matching in Turnstile Streams
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
On Estimating Maximum Matching Size in Graph Streams
A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model
Streaming Algorithms for Estimating the Matching Size in Planar Graphs and Beyond
Planar Matching in Streams Revisited
Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams
A simple augmentation method for matchings with applications to streaming algorithms
Optimal lower bounds for matching and vertex cover in dynamic graph streams
The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs
Weighted Matchings via Unweighted Augmentations
Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples
Approximate Maximum Matching in Random Streams
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs
Parameterized Streaming: Maximal Matching and Vertex Cover
Approximating matching size from random streams
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Better bounds for matchings in the streaming model
Towards a unified theory of sparsification for matching problems
Simplified and space-optimal semi-streaming \((2+\varepsilon)\)-approximate matching

This page was built for publication: Improved bounds for matching in random-order streams

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