On maximum-sum matchings of points
From MaRDI portal
Publication:2679241
DOI10.1007/s10898-022-01199-zOpenAlexW2990353831WikidataQ128281206 ScholiaQ128281206MaRDI QIDQ2679241
Clemens Huemer, Pablo Pérez-Lantero, Sergey Bereg, David Flores-Peñaloza, Carlos Seara, Oscar P. Chacón-Rivera
Publication date: 19 January 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.10610
Related Items
Intersecting diametral balls induced by a geometric graph. II, Piercing diametral disks induced by edges of maximum spanning trees, Intersecting diametral balls induced by a geometric graph, Intersecting ellipses induced by a max-sum matching, Center of maximum-sum matchings of bichromatic points
Uses Software
Cites Work
- Unnamed Item
- Matching colored points with rectangles
- Problem-solving through problems
- Non-crossing matchings of points with geometric objects
- Tverberg's theorem, disks, and Hamiltonian cycles
- Matching points with rectangles and squares
- Matching points with squares
- On minimum stars and maximum matchings.
- Stabbing pairwise intersecting disks by five points
- Bichromatic compatible matchings
- Matching points with disks with a common intersection
- Designing Least-Cost Nonblocking Broadband Networks
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Matching Points with Circles and Squares
- Matching random colored points with rectangles
- Matching colored points in the plane: Some new results
