{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:52Z","timestamp":1777954612207,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":72,"publisher":"ACM","funder":[{"name":"Google Research Scholar"},{"name":"NSF Faculty Early Career Development Program","award":["2340048"],"award-info":[{"award-number":["2340048"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743312","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"443-457","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A framework for boosting matching approximation: parallel, distributed, and dynamic"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9269-4379","authenticated-orcid":false,"given":"Slobodan","family":"Mitrovi\u0107","sequence":"first","affiliation":[{"name":"UC Davis, Davis, USA, University of Novi Sad, Novi Sad, Serbia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2707-8612","authenticated-orcid":false,"given":"Wen-Horng","family":"Sheu","sequence":"additional","affiliation":[{"name":"UC Davis, Davis, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"32nd International Symposium on Distributed Computing (DISC 2018","author":"Ahmadi Mohamad","year":"2018","unstructured":"Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. Distributed approximate maximum matching in the congest model. In 32nd International Symposium on Distributed Computing (DISC 2018). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik, 2018."},{"key":"e_1_3_2_1_2_1","volume-title":"Laminar families and metric embeddings: Non-bipartite maximum matching problem in the semi-streaming model. arXiv preprint arXiv:1104.4058","author":"Ahn Kook Jin","year":"2011","unstructured":"Kook Jin Ahn and Sudipto Guha. Laminar families and metric embeddings: Non-bipartite maximum matching problem in the semi-streaming model. arXiv preprint arXiv:1104.4058, 2011."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.006"},{"key":"e_1_3_2_1_4_1","volume-title":"Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints. ACM Transactions on Parallel Computing (TOPC), 4(4):1--40","author":"Ahn Kook Jin","year":"2018","unstructured":"Kook Jin Ahn and Sudipto Guha. Access to data and number of iterations: Dual primal algorithms for maximum matching under resource constraints. ACM Transactions on Parallel Computing (TOPC), 4(4):1--40, 2018."},{"key":"e_1_3_2_1_5_1","first-page":"337","volume-title":"Symposium on Simplicity in Algorithms (SOSA)","author":"Assadi Sepehr","year":"2024","unstructured":"Sepehr Assadi. A simple (1 - &epsis;)-approximation semi-streaming algorithm for maximum (weighted) matching. In Symposium on Simplicity in Algorithms (SOSA), pages 337--354. SIAM, 2024."},{"key":"e_1_3_2_1_6_1","first-page":"1616","volume-title":"Cliff Stein. Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Assadi Sepehr","year":"2019","unstructured":"Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab Mirrokni, and Cliff Stein. Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs. In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1616--1635. SIAM, 2019."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.19"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585110"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2022.11"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.96"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.113"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch93"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976496.18"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00058"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087806"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331609"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00027"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00096"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585231"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.97"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451113"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00108"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00095"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ESA.2023.22"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-018-0505-7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451038"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188764"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30140-0_24"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_32_1","first-page":"19","volume-title":"38th International Symposium on Distributed Computing (DISC 2024","author":"Dhulipala Laxman","year":"2024","unstructured":"Laxman Dhulipala, Michael Dinitz, Jakub \u0141\u0105cki, and Slobodan Mitrovi\u0107. Parallel set cover and hypergraph matching via uniform random sampling. In 38th International Symposium on Distributed Computing (DISC 2024), pages 19--1. Schloss Dagstuhl--Leibniz-Zentrum f\u00fcr Informatik, 2024."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2529989"},{"key":"e_1_3_2_1_34_1","volume-title":"Maximum matching and a polyhedron with 0, 1-vertices. Journal of research of the National Bureau of Standards B, 69(125-130):55--56","author":"Edmonds Jack","year":"1965","unstructured":"Jack Edmonds. Maximum matching and a polyhedron with 0, 1-vertices. Journal of research of the National Bureau of Standards B, 69(125-130):55--56, 1965."},{"key":"e_1_3_2_1_35_1","volume-title":"trees, and flowers. Canadian Journal of mathematics, 17:449--467","author":"Edmonds Jack","year":"1965","unstructured":"Jack Edmonds. Paths, trees, and flowers. Canadian Journal of mathematics, 17:449--467, 1965."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230819"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.09.013"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0344-4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520039"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/320176.320229"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331603"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212743"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585243"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.34"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538589"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.99"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25591-5_39"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.114"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.65"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0138-7"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00048"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746609"},{"key":"e_1_3_2_1_53_1","volume-title":"parallel, and semi-streaming settings. arXiv preprint arXiv:2212.14425","author":"Huang Shang-En","year":"2022","unstructured":"Shang-En Huang and Hsin-Hao Su. (1 - &epsis;)-approximate maximum weighted matching in distributed, parallel, and semi-streaming settings. arXiv preprint arXiv:2212.14425, 2022."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583668.3594570"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.141"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627938"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.112"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.55"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.107"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00006"},{"key":"e_1_3_2_1_63_1","volume-title":"Improved distributed approximate matching. Journal of the ACM (JACM), 62(5):1--17","author":"Lotker Zvi","year":"2015","unstructured":"Zvi Lotker, Boaz Patt-Shamir, and Seth Pettie. Improved distributed approximate matching. Journal of the ACM (JACM), 62(5):1--17, 2015."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.12"},{"key":"e_1_3_2_1_66_1","volume-title":"Toward optimal semi-streaming algorithm for 1 + &epsis;-approximate maximum matching. In under submission, page 248--260","author":"Mitrovi\u0107 Slobodan","year":"2024","unstructured":"Slobodan Mitrovi\u0107, Anish Mukherjee, Piotr Sankowski, and Wen-Horng Sheu. Toward optimal semi-streaming algorithm for 1 + &epsis;-approximate maximum matching. In under submission, page 248--260, 2024."},{"key":"e_1_3_2_1_67_1","volume-title":"A framework for boosting matching approximation: parallel, distributed, and dynamic. CoRR, abs\/2503.01147","author":"Mitrovi\u0107 Slobodan","year":"2025","unstructured":"Slobodan Mitrovi\u0107 and Wen-Horng Sheu. A framework for boosting matching approximation: parallel, distributed, and dynamic. CoRR, abs\/2503.01147, 2025. URL: https:\/\/arxiv.org\/abs\/2503.01147, arXiv:2503.01147."},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.5555\/1280283.1280327"},{"key":"e_1_3_2_1_69_1","volume-title":"8th Innovations in Theoretical Computer Science Conference (ITCS 2017","author":"Stubbs Daniel","year":"2017","unstructured":"Daniel Stubbs and Virginia Vassilevska Williams. Metatheorems for dynamic weighted matching. In 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik, 2017."},{"key":"e_1_3_2_1_70_1","volume-title":"38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018","author":"Tirodkar Sumedh","year":"2018","unstructured":"Sumedh Tirodkar. Deterministic algorithms for maximum matching on general graphs in the semi-streaming model. In 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik, 2018."},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00037"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32726-1"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:19:34Z","timestamp":1777922374000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":72,"alternative-id":["10.1145\/3694906.3743312","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743312","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}