On maximum-sum matchings of points
From MaRDI portal
Publication:2679241
Recommendations
Cites work
- Bichromatic compatible matchings
- Designing Least-Cost Nonblocking Broadband Networks
- scientific article; zbMATH DE number 4017764 (Why is no real title available?)
- Matching colored points in the plane: Some new results
- Matching colored points with rectangles
- Matching Points with Circles and Squares
- Matching points with disks with a common intersection
- Matching points with rectangles and squares
- Matching points with squares
- Matching random colored points with rectangles
- Non-crossing matchings of points with geometric objects
- On minimum stars and maximum matchings.
- Problem-solving through problems
- Stabbing pairwise intersecting disks by five points
- Theorems of Carathéodory, Helly, and Tverberg without dimension
- Tverberg's theorem, disks, and Hamiltonian cycles
Cited in
(12)- Matching points with disks with a common intersection
- On the intersection number of matchings and minimum weight perfect matchings of multicolored point sets
- 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
- Piercing diametral disks induced by edges of maximum spanning trees
- Euclidean maximum matchings in the plane -- local to global
- Crossing-free monochromatic trees for bicolored point sets
- On maximum-sum matchings of bichromatic points
- Euclidean maximum matchings in the plane -- local to global
This page was built for publication: On maximum-sum matchings of points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679241)
