Document Open Access Logo

Weighted Matching in the Semi-Streaming Model

Author Mariano Zelke

Thumbnail PDF


  • Filesize: 175 kB
  • 12 pages

Document Identifiers

Author Details

Mariano Zelke

Cite AsGet BibTex

Mariano Zelke. Weighted Matching in the Semi-Streaming Model. In 25th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 1, pp. 669-680, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)


We reduce the best known approximation ratio for finding a weighted matching of a graph using a one-pass semi-streaming algorithm from 5.828 to 5.585. The semi-streaming model forbids random access to the input and restricts the memory to $mathcal{O(ncdotmbox{polylog,n)$ bits. It was introduced by Muthukrishnan in 2003 and is appropriate when dealing with massive graphs.
  • Semi-streaming algorithm
  • matching
  • approximation algorithm
  • graph algorithm


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail