N. Bansal, N. Buchbinder, A. Gupta, and J. Naor, An O(log 2 k)-competitive algorithm for metric bipartite matching, Proceedings of the 15th Annual European Symposium on Algorithms, pp.522-533, 2007.

M. Elkin and J. Zhang, Efficient algorithms for constructing (1+???,??)-spanners in the distributed and streaming models, Distributed Computing, vol.51, issue.3, pp.375-385, 2006.
DOI : 10.1007/s00446-005-0147-2

L. Epstein, A. Levin, J. Mestre, and D. Segev, Improved Approximation Guarantees for Weighted Matching in the Semi-streaming Model, SIAM Journal on Discrete Mathematics, vol.25, issue.3, 2009.
DOI : 10.1137/100801901
URL : https://hal.archives-ouvertes.fr/inria-00456411

J. Feigenbaum, S. Kannan, A. Mcgregor, S. Suri, and J. Zhang, On graph problems in a semi-streaming model, Theoretical Computer Science, vol.348, issue.2-3, pp.207-216, 2005.
DOI : 10.1016/j.tcs.2005.09.013

J. Feigenbaum, S. Kannan, A. Mcgregor, S. Suri, and J. Zhang, Graph Distances in the Data-Stream Model, SIAM Journal on Computing, vol.38, issue.5, pp.1709-1727, 2008.
DOI : 10.1137/070683155

J. A. Garay, I. S. Gopal, S. Kutten, Y. Mansour, and M. Yung, Efficient On-Line Call Control Algorithms, Journal of Algorithms, vol.23, issue.1, pp.180-194, 1997.
DOI : 10.1006/jagm.1996.0821

B. Kalyanasundaram and K. Pruhs, Online Weighted Matching, Journal of Algorithms, vol.14, issue.3, pp.478-488, 1993.
DOI : 10.1006/jagm.1993.1026
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.2873

M. Kao, J. H. Reif, and S. R. Tate, Searching in an Unknown Environment: An Optimal Randomized Algorithm for the Cow-Path Problem, Information and Computation, vol.131, issue.1, pp.63-79, 1996.
DOI : 10.1006/inco.1996.0092

R. M. Karp, U. V. Vazirani, and V. V. Vazirani, An optimal algorithm for on-line bipartite matching, Proceedings of the twenty-second annual ACM symposium on Theory of computing , STOC '90, pp.352-358, 1990.
DOI : 10.1145/100216.100262

S. Khuller, S. G. Mitchell, and V. V. Vazirani, On-line algorithms for weighted bipartite matching and stable marriages, Theoretical Computer Science, vol.127, issue.2, pp.255-267, 1994.
DOI : 10.1016/0304-3975(94)90042-6

J. Maue and P. Sanders, Engineering Algorithms for Approximate Weighted Matching, Proceedings of the 6th International Workshop on Experimental Algorithms, pp.242-255, 2007.
DOI : 10.1007/978-3-540-72845-0_19

A. Mcgregor, Finding Graph Matchings in Data Streams, Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp.170-181, 2005.
DOI : 10.1007/11538462_15

M. Müller-hannemann and A. Schwartz, Implementing weighted b-matching algorithms, Journal of Experimental Algorithmics, vol.4, p.7, 1999.
DOI : 10.1145/347792.347815

S. Muthukrishnan, Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science, 2005.
DOI : 10.1561/0400000002
URL : http://ce.sharif.edu/courses/90-91/1/ce797-1/resources/root/Data_Streams_-_Algorithms_and_Applications.pdf

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, 2003.

M. Zelke, Weighted Matching in the Semi-Streaming Model, Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, pp.669-680, 2008.
DOI : 10.1007/s00453-010-9438-5
URL : https://hal.archives-ouvertes.fr/hal-00255934