{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T09:07:38Z","timestamp":1726304858390},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,8,7]],"date-time":"2010-08-07T00:00:00Z","timestamp":1281139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00453-010-9438-5","type":"journal-article","created":{"date-parts":[[2010,8,6]],"date-time":"2010-08-06T14:26:53Z","timestamp":1281104813000},"page":"1-20","source":"Crossref","is-referenced-by-count":18,"title":["Weighted Matching in the Semi-Streaming Model"],"prefix":"10.1007","volume":"62","author":[{"given":"Mariano","family":"Zelke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,7]]},"reference":[{"issue":"1","key":"9438_CR1","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1077464.1077472","volume":"1","author":"D.E. Drake Vinkemeier","year":"2005","unstructured":"Drake Vinkemeier, D.E., Hougardy, S.: A linear-time approximation algorithm for weighted matchings in graphs. ACM Trans. Algorithms (TALG) 1(1), 107\u2013122 (2005)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"9438_CR2","unstructured":"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\u2013358 (2010)"},{"key":"9438_CR3","series-title":"LNCS","first-page":"531","volume-title":"On graph problems in a semi-streaming model. ICALP 2004","author":"J. Feigenbaum","year":"2004","unstructured":"Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. ICALP 2004. In: LNCS, vol.\u00a03142, pp. 531\u2013543, Springer, Berlin (2004)"},{"key":"9438_CR4","unstructured":"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.\u00a0745\u2013754 (2005)"},{"key":"9438_CR5","unstructured":"Gabow, H.N.: Data structures for weighted matchings and nearest common ancestors with linking. In: Proc. ACM-SIAM SODA (1990), pp.\u00a0434\u2013443 (1990)"},{"key":"9438_CR6","unstructured":"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.\u00a050, pp.\u00a0107\u2013118, (1999)"},{"key":"9438_CR7","series-title":"LNCS","first-page":"170","volume-title":"Finding graph matchings in data streams. APPROX and RANDOM 2005","author":"A. McGregor","year":"2005","unstructured":"McGregor, A.: Finding graph matchings in data streams. APPROX and RANDOM 2005. In: LNCS, vol. 3624, pp. 170\u2013181, Springer, Berlin (2005)"},{"key":"9438_CR8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/s004539910008","volume":"26","author":"R.H. M\u00f6hring","year":"2000","unstructured":"M\u00f6hring, R.H., M\u00fcller-Hannemann, M.: Complexity and modeling aspects of mesh refinement into quadrilaterals. Algorithmica 26, 148\u2013171 (2000)","journal-title":"Algorithmica"},{"key":"9438_CR9","doi-asserted-by":"crossref","first-page":"1609","DOI":"10.1016\/S0167-8191(00)00049-1","volume":"26","author":"B. Monien","year":"2000","unstructured":"Monien, B., Preis, R., Diekmann, R.: Quality matching and local improvement for multilevel graph-partitioning. Parallel. Comput. 26, 1609\u20131634 (2000)","journal-title":"Parallel. Comput."},{"key":"9438_CR10","unstructured":"Muthukrishnan, S.: Data streams: algorithms and applications. Available at http:\/\/athos.rutgers.edu\/~muthu\/stream-1-1.ps (2003)"},{"issue":"6","key":"9438_CR11","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.ipl.2004.05.007","volume":"91","author":"S. Pettie","year":"2004","unstructured":"Pettie, S., Sanders, P.: A simpler linear time 2\/3-\u03b5 approximation for maximum weight matching. Inf. Process. Lett. 91(6), 271\u2013276 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9438_CR12","series-title":"LNCS","first-page":"259","volume-title":"16th Annual Symposium on Theoretical Aspects of Computer Science STACS 1999","author":"R. Preis","year":"1999","unstructured":"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\u2013269, Springer, Berlin (1999)"},{"key":"9438_CR13","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A. Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"3","key":"9438_CR14","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ipl.2007.06.004","volume":"104","author":"M. Zelke","year":"2007","unstructured":"Zelke, M.: Optimal per-edge processing times in the semi-streaming model. Inf. Process. Lett. 104(3), 106\u2013112 (2007)","journal-title":"Inf. Process. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9438-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9438-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9438-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:06Z","timestamp":1559137506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9438-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,7]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9438"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9438-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,7]]}}}