Euclidean maximum matchings in the plane -- local to global
From MaRDI portal
Publication:832859
DOI10.1007/978-3-030-83508-8_14OpenAlexW3190359733MaRDI QIDQ832859FDOQ832859
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
maximum matchingglobal maximumlocal maximumpairwise crossing matchingpairwise intersecting disksplanar points
Cites Work
- Title not available (Why is that?)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Paths, Trees, and Flowers
- Title not available (Why is that?)
- Title not available (Why is that?)
- An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs
- Maximum matching and a polyhedron with 0,1-vertices
- Linear-time approximation for maximum weight matching
- Title not available (Why is that?)
- Submodular maximization over multiple matroids via generalized exchange properties
- Long non-crossing configurations in the plane
- A survey of heuristics for the weighted matching problem
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- A linear-time algorithm for edge-disjoint paths in planar graphs
- Multicommodity flows in planar graphs
- Title not available (Why is that?)
- On local search for weighted \(k\)-set packing
- Title not available (Why is that?)
- Maximum plane trees in multipartite geometric graphs
- On the Euclidean assignment problem
- Partitioning heuristics for two geometric maximization problems
- Matching points with disks with a common intersection
- Stabbing pairwise intersecting disks by five points
- Title not available (Why is that?)
- Data structures for weighted matching and extensions to \(b\)-matching and \(f\)-factors
Cited In (1)
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)
