Euclidean maximum matchings in the plane -- local to global

DOI10.1007/978-3-030-83508-8_14MaRDI QIDQ832859zbMATH OpenOpenAlexFDO

Authors Ahmad Biniaz, Anil Maheshwari, Michiel Smid

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-83508-8_14

zbMATH Keywords

maximum matchingglobal maximumlocal maximumpairwise crossing matchingpairwise intersecting disksplanar points

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Recommendations

• Euclidean maximum matchings in the plane -- local to global
• On maximum-sum matchings of points
• Center of maximum-sum matchings of bichromatic points
• Matching points with disks with a common intersection
• scientific article; zbMATH DE number 741010

Cites work

• scientific article; zbMATH DE number 4017764 (Why is no real title available?)
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 432790 (Why is no real title available?)
• scientific article; zbMATH DE number 3971629 (Why is no real title available?)
• scientific article; zbMATH DE number 741010 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3231693 (Why is no real title available?)
• A linear-time algorithm for edge-disjoint paths in planar graphs
• A survey of heuristics for the weighted matching problem
• An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
• Data structures for weighted matching and extensions to \(b\)-matching and \(f\)-factors
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• Linear-time approximation for maximum weight matching
• Long non-crossing configurations in the plane
• Matching points with disks with a common intersection
• Maximum matching and a polyhedron with 0,1-vertices
• Maximum plane trees in multipartite geometric graphs
• Multicommodity flows in planar graphs
• On local search for weighted \(k\)-set packing
• On the Euclidean assignment problem
• Partitioning heuristics for two geometric maximization problems
• Paths, Trees, and Flowers
• Stabbing pairwise intersecting disks by five points
• Submodular maximization over multiple matroids via generalized exchange properties
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(4)

• Euclidean maximum matchings in the plane -- local to global
• Center of maximum-sum matchings of bichromatic points
• Intersecting ellipses induced by a max-sum matching
• Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension

This page was built for publication: Euclidean maximum matchings in the plane -- local to global

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832859)