{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:31Z","timestamp":1750221091126,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T00:00:00Z","timestamp":1544140800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["JP18H05291"],"award-info":[{"award-number":["JP18H05291"]}]},{"DOI":"10.13039\/501100014086","name":"Fondation Sciences Math\u00e9matiques de Paris","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100014086","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Algorithms"],"published-print":{"date-parts":[[2019,4,30]]},"abstract":"<jats:p>We present a simple deterministic single-pass (2+\u03f5)-approximation algorithm for the maximum weight matching problem in the semi-streaming model. This improves on the currently best known approximation ratio of (4+\u03f5).<\/jats:p>\n          <jats:p>\n            Our algorithm uses\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            log\n            <jats:sup>2<\/jats:sup>\n            <jats:italic>n<\/jats:italic>\n            ) bits of space for constant values of \u03f5. It relies on a variation of the local-ratio theorem, which may be of use for other algorithms in the semi-streaming model as well.\n          <\/jats:p>","DOI":"10.1145\/3274668","type":"journal-article","created":{"date-parts":[[2018,12,7]],"date-time":"2018-12-07T13:17:29Z","timestamp":1544188649000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A (2+\u03f5)-Approximation for Maximum Weight Matching in the Semi-streaming Model"],"prefix":"10.1145","volume":"15","author":[{"given":"Ami","family":"Paz","sequence":"first","affiliation":[{"name":"IRIF, CNRS and Paris Diderot University, Paris CEDEX, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Schwartzman","sequence":"additional","affiliation":[{"name":"National Institute of Informatics, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039799"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884528"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/502102.502107"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1041680.1041683"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)73101-3"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_23"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07557-0_18"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2884435.2884527"},{"volume-title":"Proceedings of the Annual Conference on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX\/RANDOM\u201914)","author":"Crouch Michael","key":"e_1_2_1_9_1","unstructured":"Michael Crouch and Daniel S. Stubbs . 2014. Improved streaming algorithms for weighted matching, via unweighted matching . In Proceedings of the Annual Conference on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX\/RANDOM\u201914) . 96--104. Michael Crouch and Daniel S. Stubbs. 2014. Improved streaming algorithms for weighted matching, via unweighted matching. In Proceedings of the Annual Conference on Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques (APPROX\/RANDOM\u201914). 96--104."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40450-4_29"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1965-045-4"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/100801901"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_2_1_14_1","volume-title":"Simplified and space-optimal semi-streaming for (2 + &epsi;)-approximate matching. CoRR abs\/1701.03730","author":"Ghaffari Mohsen","year":"2018","unstructured":"Mohsen Ghaffari and David Wajc . 2018. Simplified and space-optimal semi-streaming for (2 + &epsi;)-approximate matching. CoRR abs\/1701.03730 ( 2018 ). To be presented in SOSA 2019. http:\/\/arxiv.org\/abs\/1701.03730 Mohsen Ghaffari and David Wajc. 2018. Simplified and space-optimal semi-streaming for (2 + &epsi;)-approximate matching. CoRR abs\/1701.03730 (2018). To be presented in SOSA 2019. http:\/\/arxiv.org\/abs\/1701.03730"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095157"},{"key":"e_1_2_1_16_1","volume-title":"Streaming weighted matchings: Optimal meets greedy. CoRR abs\/1608.01487","author":"Grigorescu Elena","year":"2016","unstructured":"Elena Grigorescu , Morteza Monemizadeh , and Samson Zhou . 2016. Streaming weighted matchings: Optimal meets greedy. CoRR abs\/1608.01487 ( 2016 ). DOI:http:\/\/arxiv.org\/abs\/1608.01487 Elena Grigorescu, Morteza Monemizadeh, and Samson Zhou. 2016. Streaming weighted matchings: Optimal meets greedy. CoRR abs\/1608.01487 (2016). DOI:http:\/\/arxiv.org\/abs\/1608.01487"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627938"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634129"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_70"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.12"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP\u201911","author":"Varadaraja Ashwinkumar Badanidiyuru","year":"2011","unstructured":"Ashwinkumar Badanidiyuru Varadaraja . 2011 . Buyback problem - Approximate matroid intersection with cancellation costs . In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP\u201911 . 379--390. Ashwinkumar Badanidiyuru Varadaraja. 2011. Buyback problem - Approximate matroid intersection with cancellation costs. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP\u201911. 379--390."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-010-9438-5"}],"container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274668","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3274668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:57:56Z","timestamp":1750208276000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3274668"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,7]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,4,30]]}},"alternative-id":["10.1145\/3274668"],"URL":"https:\/\/doi.org\/10.1145\/3274668","relation":{},"ISSN":["1549-6325","1549-6333"],"issn-type":[{"type":"print","value":"1549-6325"},{"type":"electronic","value":"1549-6333"}],"subject":[],"published":{"date-parts":[[2018,12,7]]},"assertion":[{"value":"2017-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-12-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}