On maximum-sum matchings of bichromatic points (2403.08977v2)
Abstract: Huemer et al. (Discrete Math, 2019) proved that for any two finite point sets $R$ and $B$ in the plane with $|R| = |B|$, the perfect matching that matches points of $R$ with points of $B$, and maximizes the total squared Euclidean distance of the matched pairs, has the property that all the disks induced by the matching have a nonempty common intersection. A pair of matched points induces the disk that has the segment connecting the points as diameter. In this note, we characterize these maximum-sum matchings for some family of continuous (semi-)metrics, focusing on both the Euclidean distance and squared Euclidean distance. Using this characterization, we give a different but simpler proof for the common intersection property proved by Huemer et al..
- Piercing diametral disks induced by edges of maximum spanning trees. In WALCOM, pages 71–77. Springer, 2023.
- P. Barabanshchikova and A. Polyanskii. Intersecting ellipses induced by a max-sum matching. Journal of Global Optimization, pages 1–13, 2023.
- P. Barabanshchikova and A. Polyanskii. Intersecting diametral balls induced by a geometric graph II. Discrete Mathematics, 347(1):113694, 2024.
- On maximum-sum matchings of points. Journal of Global Optimization, 85(1):111–128, 2023.
- D. Eppstein. Geometry Junkyard. https://www.ics.uci.edu/~eppstein/junkyard/maxmatch.html.
- Designing least-cost nonblocking broadband networks. J. Algorithms, 24(2):287–309, 1997.
- E. Helly. Über Mengen konvexer Körper mit gemeinschaftlichen Punkte. Jahresbericht der Deutschen Mathematiker-Vereinigung, 32:175–176, 1923.
- Matching points with disks with a common intersection. Discrete Mathematics, 342(7):1885–1893, 2019.
- P. Pérez-Lantero and C. Seara. Center of maximum-sum matchings of bichromatic points. Discrete Mathematics, 347(3):113822, 2024.
- Intersecting diametral balls induced by a geometric graph. Discrete & Computational Geometry, pages 1–18, 2022.
- P. Soberón and Y. Tang. Tverberg’s theorem, disks, and Hamiltonian cycles. Annals of Combinatorics, 25(4):995–1005, 2021.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
