{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:25Z","timestamp":1740109345456,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T00:00:00Z","timestamp":1729296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T00:00:00Z","timestamp":1729296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00453-024-01279-4","type":"journal-article","created":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T20:30:43Z","timestamp":1729369843000},"page":"132-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Euclidean Maximum Matchings in the Plane\u2014Local to Global"],"prefix":"10.1007","volume":"87","author":[{"given":"Ahmad","family":"Biniaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,19]]},"reference":[{"issue":"4","key":"1279_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.3233\/FI-1995-2245","volume":"22","author":"N Alon","year":"1995","unstructured":"Alon, N., Rajagopalan, S., Suri, S.: Long non-crossing configurations in the plane. Fundam. Inform. 22(4), 385\u2013394 (1995)","journal-title":"Fundam. Inform."},{"issue":"3","key":"1279_CR2","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"EM Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On local search for weighted $$k$$-set packing. Math. of Op. Res. 23(3), 640\u2013648 (1998)","journal-title":"Math. of Op. Res."},{"issue":"4","key":"1279_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1002\/net.3230130404","volume":"13","author":"D Avis","year":"1983","unstructured":"Avis, D.: A survey of heuristics for the weighted matching problem. Networks 13(4), 475\u2013493 (1983)","journal-title":"Networks"},{"issue":"2","key":"1279_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10898-023-01312-w","volume":"88","author":"P Barabanshchikova","year":"2024","unstructured":"Barabanshchikova, P., Polyanskii, A.: Intersecting ellipses induced by a max-sum matching. J. of Glob. Optim. 88(2), 395\u2013407 (2024)","journal-title":"J. of Glob. Optim."},{"issue":"1","key":"1279_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10898-022-01199-z","volume":"85","author":"S Bereg","year":"2023","unstructured":"Bereg, S., Chac\u00f3n-Rivera, O., Flores-Pe\u00f1aloza, D., Huemer, C., P\u00e9rez-Lantero, P., Seara, C.: On maximum-sum matchings of points. J. of Glob. Optim. 85(1), 111\u2013128 (2023)","journal-title":"J. of Glob. Optim."},{"issue":"4","key":"1279_CR6","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1007\/s00453-018-0482-x","volume":"81","author":"A Biniaz","year":"2019","unstructured":"Biniaz, A., Bose, P., Crosbie, K., Carufel, J.D., Eppstein, D., Maheshwari, A., Smid, M.H.M.: Maximum plane trees in multipartite geometric graphs. Algorithmica 81(4), 1512\u20131534 (2019)","journal-title":"Algorithmica"},{"issue":"4","key":"1279_CR7","doi-asserted-by":"publisher","first-page":"1751","DOI":"10.1007\/s00454-023-00567-0","volume":"70","author":"P Carmi","year":"2023","unstructured":"Carmi, P., Katz, M.J., Morin, P.: Stabbing pairwise intersecting disks by four points. Discrete Computational Geom. 70(4), 1751\u20131784 (2023)","journal-title":"Discrete Computational Geom."},{"issue":"1\u20132","key":"1279_CR8","first-page":"111","volume":"21","author":"L Danzer","year":"1986","unstructured":"Danzer, L.: Zur L\u00f6sung des Gallaischen Problems \u00fcber Kreisscheiben in der Euklidischen Ebene. Stud. Sci. Math. Hung. 21(1\u20132), 111\u2013134 (1986)","journal-title":"Stud. Sci. Math. Hung."},{"issue":"1","key":"1279_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2529989","volume":"61","author":"R Duan","year":"2014","unstructured":"Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. of the ACM 61(1), 1\u201323 (2014)","journal-title":"J. of the ACM"},{"issue":"4","key":"1279_CR10","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s00454-010-9277-9","volume":"44","author":"A Dumitrescu","year":"2010","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Long non-crossing configurations in the plane. Discrete Comput Geom 44(4), 727\u2013752 (2010)","journal-title":"Discrete Comput Geom"},{"issue":"5","key":"1279_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0167-6377(84)90059-2","volume":"3","author":"M Dyer","year":"1984","unstructured":"Dyer, M., Frieze, A., McDiarmid, C.: Partitioning heuristics for two geometric maximization problems. Operations Res. Lett. 3(5), 267\u2013270 (1984)","journal-title":"Operations Res. Lett."},{"key":"1279_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. J. Res. of the Natl. Bur. of Stand. B 69, 125\u2013130 (1965)","journal-title":"J. Res. of the Natl. Bur. of Stand. B"},{"key":"1279_CR13","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadi. J. of Math. 17, 449\u2013467 (1965)","journal-title":"Canadi. J. of Math."},{"issue":"2","key":"1279_CR14","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. of the ACM 19(2), 248\u2013264 (1972)","journal-title":"J. of the ACM"},{"key":"1279_CR15","unstructured":"Eppstein, D. Geometry junkyard. https:\/\/www.ics.uci.edu\/~eppstein\/junkyard\/maxmatch.html"},{"key":"1279_CR16","unstructured":"Gabow, H.\u00a0N.: Data structures for weighted matching and nearest common ancestors with linking. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 434\u2013443, 1990"},{"issue":"3","key":"1279_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3183369","volume":"14","author":"HN Gabow","year":"2018","unstructured":"Gabow, H.N.: Data structures for weighted matching and extensions to b-matching and f-factors. ACM Trans. on Algorithms 14(3), 1\u201380 (2018)","journal-title":"ACM Trans. on Algorithms"},{"issue":"3","key":"1279_CR18","doi-asserted-by":"publisher","first-page":"540","DOI":"10.1145\/65950.65954","volume":"36","author":"HN Gabow","year":"1989","unstructured":"Gabow, H.N., Galil, Z., Spencer, T.H.: Efficient implementation of graph algorithms using contraction. J. of the ACM 36(3), 540\u2013572 (1989)","journal-title":"J. of the ACM"},{"issue":"1","key":"1279_CR19","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1137\/0215009","volume":"15","author":"Z Galil","year":"1986","unstructured":"Galil, Z., Micali, S., Gabow, H.N.: An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. on Computing 15(1), 120\u2013130 (1986)","journal-title":"SIAM J. on Computing"},{"issue":"3","key":"1279_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0204019","volume":"4","author":"F Hadlock","year":"1975","unstructured":"Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. on Computing 4(3), 221\u2013225 (1975)","journal-title":"SIAM J. on Computing"},{"key":"1279_CR21","unstructured":"Har-Peled, S., Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M., Willert, M.: Stabbing pairwise intersecting disks by five points. In 29th International Symposium on Algorithms and Computation, ISAAC, pages 50:1\u201350:12, 2018"},{"key":"1279_CR22","first-page":"175","volume":"32","author":"E Helly","year":"1923","unstructured":"Helly, E.: \u00dcber Mengen konvexer K\u00f6rper mit gemeinschaftlichen Punkten. Jahresber. der Dtsch. Math.-Ver. 32, 175\u2013176 (1923)","journal-title":"Jahresber. der Dtsch. Math.-Ver."},{"issue":"7","key":"1279_CR23","doi-asserted-by":"publisher","first-page":"1885","DOI":"10.1016\/j.disc.2019.03.003","volume":"342","author":"C Huemer","year":"2019","unstructured":"Huemer, C., P\u00e9rez-Lantero, P., Seara, C., Silveira, R.I.: Matching points with disks with a common intersection. Discrete Math. 342(7), 1885\u20131893 (2019)","journal-title":"Discrete Math."},{"key":"1279_CR24","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83\u201397 (1955)","journal-title":"Nav. Res. Logist. Q."},{"key":"1279_CR25","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1002\/nav.3800030404","volume":"3","author":"HW Kuhn","year":"1956","unstructured":"Kuhn, H.W.: Variants of the Hungarian method for assignment problems. Nav. Res. Logist. Q. 3, 253\u2013258 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"1279_CR26","volume-title":"Combinatorial optimization: networks and matroids","author":"E Lawler","year":"1976","unstructured":"Lawler, E.: Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York (1976)"},{"issue":"4","key":"1279_CR27","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1287\/moor.1100.0463","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Op. Res. 35(4), 795\u2013806 (2010)","journal-title":"Math. Op. Res."},{"key":"1279_CR28","doi-asserted-by":"crossref","unstructured":"McKeown, N., Anantharam, V., Walrand, J.\u00a0C.: Achieving 100% throughput in an input-queued switch. In Proceedings of the 15th IEEE INFOCOM, pages 296\u2013302, 1996","DOI":"10.1109\/INFCOM.1996.497906"},{"issue":"1","key":"1279_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. of Combinatorial Theory, Series B 31(1), 75\u201381 (1981)","journal-title":"J. of Combinatorial Theory, Series B"},{"issue":"1","key":"1279_CR30","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01464231","volume":"83","author":"J Radon","year":"1921","unstructured":"Radon, J.: Mengen konvexer K\u00f6rper, die einen gemeinsamen Punkt enthalten. Math. Annalen 83(1), 113\u2013115 (1921)","journal-title":"Math. Annalen"},{"issue":"3","key":"1279_CR31","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0377-0427(88)90001-5","volume":"23","author":"F Rendl","year":"1988","unstructured":"Rendl, F.: On the Euclidean assignment problem. J. of Computational and Appl. Math. 23(3), 257\u2013265 (1988)","journal-title":"J. of Computational and Appl. Math."},{"issue":"1\u20133","key":"1279_CR32","first-page":"19","volume":"32","author":"L Stach\u00f3","year":"1981","unstructured":"Stach\u00f3, L.: A solution of Gallai\u2019s problem on pinning down circles. Matematikai Lapok 32(1\u20133), 19\u201347 (1981)","journal-title":"Matematikai Lapok"},{"issue":"1","key":"1279_CR33","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01294465","volume":"15","author":"D Wagner","year":"1995","unstructured":"Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica 15(1), 135\u2013150 (1995)","journal-title":"Combinatorica"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01279-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-024-01279-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01279-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T13:24:37Z","timestamp":1737120277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-024-01279-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,19]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1279"],"URL":"https:\/\/doi.org\/10.1007\/s00453-024-01279-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2024,10,19]]},"assertion":[{"value":"30 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}