Skip to main content
SpringerLink
Log in

Weighted Matching in the Semi-Streaming Model

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present an approximation algorithm to find a weighted matching of a graph in the one-pass semi-streaming model. The semi-streaming model forbids random access to the input graph and restricts the memory to \({\mathcal{O}}(n\cdot\operatorname{polylog}n)\) bits where n denotes the number of the vertices of the input graph. We obtain an approximation ratio of 5.58 while the previously best algorithm achieves a ratio of 5.82.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Drake Vinkemeier, D.E., Hougardy, S.: A linear-time approximation algorithm for weighted matchings in graphs. ACM Trans. Algorithms (TALG) 1(1), 107–122 (2005)

    Article  MathSciNet  Google Scholar 

  2. Epstein, L., Levin, A., Mestre, J., Segev, D.: Improved approximation guarantees for weighted matching in the semi-streaming model. In: 27th International Symposium on Theoretical Aspects of Computer Science STACS 2010, pp. 347–358 (2010)

  3. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. ICALP 2004. In: LNCS, vol. 3142, pp. 531–543, Springer, Berlin (2004)

    Google Scholar 

  4. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the streaming model: the value of space. In: Proc. ACM-SIAM SODA (2005), pp. 745–754 (2005)

  5. Gabow, H.N.: Data structures for weighted matchings and nearest common ancestors with linking. In: Proc. ACM-SIAM SODA (1990), pp. 434–443 (1990)

  6. Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External Memory Algorithms. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 107–118, (1999)

  7. McGregor, A.: Finding graph matchings in data streams. APPROX and RANDOM 2005. In: LNCS, vol. 3624, pp. 170–181, Springer, Berlin (2005)

    Google Scholar 

  8. Möhring, R.H., Müller-Hannemann, M.: Complexity and modeling aspects of mesh refinement into quadrilaterals. Algorithmica 26, 148–171 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Monien, B., Preis, R., Diekmann, R.: Quality matching and local improvement for multilevel graph-partitioning. Parallel. Comput. 26, 1609–1634 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Muthukrishnan, S.: Data streams: algorithms and applications. Available at http://athos.rutgers.edu/~muthu/stream-1-1.ps (2003)

  11. Pettie, S., Sanders, P.: A simpler linear time 2/3-ε approximation for maximum weight matching. Inf. Process. Lett. 91(6), 271–276 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  12. Preis, R.: Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In: 16th Annual Symposium on Theoretical Aspects of Computer Science STACS 1999. LNCS, vol. 1563, pp. 259–269, Springer, Berlin (1999)

    Google Scholar 

  13. Schrijver, A. Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  14. Zelke, M.: Optimal per-edge processing times in the semi-streaming model. Inf. Process. Lett. 104(3), 106–112 (2007)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Goethe-Universität, 60054, Frankfurt am Main, Germany

    Mariano Zelke

Authors
  1. Mariano Zelke
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mariano Zelke.

Additional information

A preliminary version of this paper appeared in the Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science STACS 2008. Part of this work was done while the author was at Humboldt-Universität zu Berlin. Research was partially supported by the DFG Research Center Matheon in Berlin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zelke, M. Weighted Matching in the Semi-Streaming Model. Algorithmica 62, 1–20 (2012). https://doi.org/10.1007/s00453-010-9438-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-010-9438-5

Keywords

Search

Navigation