{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:10:05Z","timestamp":1750695005180,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718147","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T23:34:42Z","timestamp":1750030482000},"page":"2317-2328","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for the Geometric Multimatching Problem"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-5671-6074","authenticated-orcid":false,"given":"Shinwoo","family":"An","sequence":"first","affiliation":[{"name":"POSTECH, Pohang, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0798-2580","authenticated-orcid":false,"given":"Eunjin","family":"Oh","sequence":"additional","affiliation":[{"name":"POSTECH, Pohang, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7015-1988","authenticated-orcid":false,"given":"Jie","family":"Xue","sequence":"additional","affiliation":[{"name":"New York University Shanghai, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519977"},{"key":"e_1_3_2_1_2_1","volume-title":"Faster Algorithms for the Geometric Transportation Problem. Leibniz International Proceedings in Informatics, LIPIcs 77 ( 2019 ), 71-716","author":"Agarwal Pankaj K","year":"2019","unstructured":"Pankaj K Agarwal, Kyle Fox, Debmalya Panigrahi, Kasturi R Varadarajan, and Allen Xiao. 2019. Faster Algorithms for the Geometric Transportation Problem. Leibniz International Proceedings in Informatics, LIPIcs 77 ( 2019 ), 71-716."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591844"},{"key":"e_1_3_2_1_4_1","volume-title":"Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021 ). 44","author":"Bandyapadhyay Sayan","year":"2021","unstructured":"Sayan Bandyapadhyay, Anil Maheshwari, and Michiel Smid. 2021. Exact and Approximation Algorithms for Many-To-Many Point Matching in the Plane. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021 ). 44."},{"key":"e_1_3_2_1_5_1","volume-title":"40th International Symposium on Computational Geometry (SoCG 2024 ). 12 : 1-12 : 15","author":"Bandyapadhyay Sayan","year":"2024","unstructured":"Sayan Bandyapadhyay and Jie Xue. 2024. An ( log )-Time Approximation Scheme for Geometric Many-To-Many Matching. In 40th International Symposium on Computational Geometry (SoCG 2024 ). 12 : 1-12 : 15."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/140972858"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/200836.200853"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.178"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 26th International Conference on Neural Information Processing Systems-Volume 2 (NIPS 2013 ). 3192-3200","author":"Choromanski Krzysztof","year":"2013","unstructured":"Krzysztof Choromanski, Tony Jebara, and Kui Tang. 2013. Adaptive anonymity via-matching. In Proceedings of the 26th International Conference on Neural Information Processing Systems-Volume 2 (NIPS 2013 ). 3192-3200."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Nachshon Cohen and Zeev Nutov. 2015. Approximating minimum power edgemulti-covers. Journal of Combinatorial Optimization 30 ( 2015 ) 563-578.","DOI":"10.1007\/s10878-013-9652-6"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Justin Colannino Mirela Damian Ferran Hurtado Stefan Langerman Henk Meijer Suneeta Ramaswami Diane Souvaine and Godfried Toussaint. 2007. Eficient many-to-many point matching in one dimension. Graphs and Combinatorics 23 ( 2007 ) 169-178.","DOI":"10.1007\/s00373-007-0714-3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132599"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2529989"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Alon Efrat Alon Itai and Matthew J Katz. 2001. Geometry helps in bottleneck matching and related problems. Algorithmica 31 ( 2001 ) 1-28.","DOI":"10.1007\/s00453-001-0016-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050075"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00013"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933114"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00078"},{"key":"e_1_3_2_1_19_1","article-title":"A NEAR-LINEAR TIME APPROXIMATION SCHEME FOR GEOMETRIC TRANSPORTATION WITH ARBITRARY SUPPLIES AND SPREAD","volume":"13","author":"Fox Kyle","year":"2022","unstructured":"Kyle Fox and Jiashuai Lu. 2022. A NEAR-LINEAR TIME APPROXIMATION SCHEME FOR GEOMETRIC TRANSPORTATION WITH ARBITRARY SUPPLIES AND SPREAD. Journal of Computational Geometry 13, 1 ( 2022 ), 204-225.","journal-title":"Journal of Computational Geometry"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the fifteenth annual ACM Symposium on Theory of Computing (STOC 1983 ). 448-456","author":"Gabow Harold N","year":"1983","unstructured":"Harold N Gabow. 1983. An eficient reduction technique for degree-constrained subgraph and bidirected network flow problems. In Proceedings of the fifteenth annual ACM Symposium on Theory of Computing (STOC 1983 ). 448-456."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446281"},{"key":"e_1_3_2_1_22_1","volume-title":"Approximate generalized matching:-matchings and-edge covers. Algorithmica 84, 7 ( 2022 )","author":"Huang Dawei","year":"1952","unstructured":"Dawei Huang and Seth Pettie. 2022. Approximate generalized matching:-matchings and-edge covers. Algorithmica 84, 7 ( 2022 ), 1952-1992."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Haim Kaplan Wolfgang Mulzer Liam Roditty Paul Seiferth and Micha Sharir. 2020. Dynamic planar Voronoi diagrams for general distance functions and their algorithmic applications. Discrete & Computational Geometry 64 ( 2020 ) 838-904.","DOI":"10.1007\/s00454-020-00243-7"},{"key":"e_1_3_2_1_24_1","article-title":"Design of survivable networks: A survey. Networks","volume":"46","author":"Kerivin Herv\u00e9","year":"2005","unstructured":"Herv\u00e9 Kerivin and A Ridha Mahjoub. 2005. Design of survivable networks: A survey. Networks: An International Journal 46, 1 ( 2005 ), 1-21.","journal-title":"An International Journal"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00062"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974690.ch6"},{"key":"e_1_3_2_1_27_1","article-title":"Preconditioning for the Geometric Transportation Problem","volume":"11","author":"Khesin Andrey Boris","year":"2021","unstructured":"Andrey Boris Khesin, Aleksandar Nikolov, and Dmitry Paramonov. 2021. Preconditioning for the Geometric Transportation Problem. Journal of Computational Geometry 11, 2 ( 2021 ), 234-259.","journal-title":"Journal of Computational Geometry"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.55"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Alex Pothen SM Ferdous and Fredrik Manne. 2019. Approximation algorithms in combinatorial scientific computing. Acta Numerica 28 ( 2019 ) 541-633.","DOI":"10.1017\/S0962492919000035"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3393694"},{"key":"e_1_3_2_1_31_1","volume-title":"Combinatorial Optimization: Polyhedra and Eficiency.","author":"Alexander Schrijver","year":"2003","unstructured":"Alexander Schrijver et al. 2003. Combinatorial Optimization: Polyhedra and Eficiency. Vol. 24. Springer."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.29"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214014"},{"volume-title":"Graph-based semisupervised learning","author":"Subramanya Amarnag","key":"e_1_3_2_1_34_1","unstructured":"Amarnag Subramanya and Partha Pratim Talukdar. 2022. Graph-based semisupervised learning. Springer Nature."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218080"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743466"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Prague Czechia","acronym":"STOC '25"},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:40:28Z","timestamp":1750693228000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":36,"alternative-id":["10.1145\/3717823.3718147","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718147","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}