Document Open Access Logo

Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching

Authors Michael Crouch, Daniel M. Stubbs

Thumbnail PDF


  • Filesize: 403 kB
  • 9 pages

Document Identifiers

Author Details

Michael Crouch
Daniel M. Stubbs

Cite AsGet BibTex

Michael Crouch and Daniel M. Stubbs. Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 96-104, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)


We present a (4 + epsilon) approximation algorithm for weighted graph matching which applies in the semistreaming, sliding window, and MapReduce models; this single algorithm improves the previous best algorithm in each model. The algorithm operates by reducing the maximum-weight matching problem to a polylog number of copies of the maximum-cardinality matching problem. The algorithm also extends to provide approximation guarantees for the more general problem of finding weighted independent sets in p-systems (which include intersections of p matroids and p-bounded hypergraph matching).
  • Streaming Algorithms
  • Graph Matching
  • Weighted Graph Matching
  • MapReduce
  • Independence Systems


  • 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