Euclidean maximum matchings in the plane -- local to global

DOI10.1007/978-3-030-83508-8_14OpenAlexW3190359733MaRDI QIDQ832859

Ahmad Biniaz, Anil Maheshwari, Michiel H. M. 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

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Long non-crossing configurations in the plane
• Partitioning heuristics for two geometric maximization problems
• On the Euclidean assignment problem
• Multicommodity flows in planar graphs
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Stabbing pairwise intersecting disks by five points
• Matching points with disks with a common intersection
• On Local Search for Weighted k-Set Packing
• Linear-Time Approximation for Maximum Weight Matching
• A survey of heuristics for the weighted matching problem
• An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Finding a Maximum Cut of a Planar Graph in Polynomial Time
• Data Structures for Weighted Matching and Extensions to b -matching and f -factors
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
• Maximum plane trees in multipartite geometric graphs

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