Approximating matching size from random streams

@inproceedings{Kapralov2014ApproximatingMS,
  title={Approximating matching size from random streams},
  author={Mikhail Kapralov and Sanjeev Khanna and Madhu Sudan},
  booktitle={SODA},
  year={2014}
}
We present a streaming algorithm that makes one pass over the edges of an unweighted graph presented in random order, and produces a polylogarithmic approximation to the size of the maximum matching in the graph, while using only polylogarithmic space. Prior to this work the only approximations known were a folklore Õ( √ n) approximation with polylogarithmic space in an n vertex graph and a constant approximation with Ω(n) space. Our work thus gives the first algorithm where both the space and… CONTINUE READING
Highly Cited
This paper has 71 citations. REVIEW CITATIONS
42 Extracted Citations
19 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

71 Citations

0102030'12'13'14'15'16'17'18
Citations per Year
Semantic Scholar estimates that this publication has 71 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…