Linear programming in the semi-streaming model with application to the maximum matching problem
From MaRDI portal
Publication:1951572
DOI10.1016/j.ic.2012.10.006zbMath1268.90028OpenAlexW1967311985MaRDI QIDQ1951572
Publication date: 6 June 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.10.006
Related Items (11)
Graph sketching and streaming: new approaches for analyzing massive graphs ⋮ (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings ⋮ Improved bounds for randomized preemptive online matching ⋮ Communication complexity of approximate maximum matching in the message-passing model ⋮ Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams ⋮ Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Correlation clustering in data streams ⋮ Depth First Search in the Semi-streaming Model ⋮ Multi-pass streaming algorithms for monotone submodular function maximization
This page was built for publication: Linear programming in the semi-streaming model with application to the maximum matching problem
