Efficient algorithms for geometric partial matching
From MaRDI portal
Recommendations
- Algorithms for the transportation problem in geometric settings
- Faster algorithms for the geometric transportation problem
- Approximation algorithms for bipartite matching with metric and geometric costs
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- A near-linear time ε-approximation algorithm for geometric bipartite matching
Cites work
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- A strongly polynomial minimum cost circulation algorithm
- Algorithms for the transportation problem in geometric settings
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
- Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
- Faster Scaling Algorithms for Network Problems
- Faster algorithms for the geometric transportation problem
- Geometry Helps in Matching
- Minimum-cost flows in unit-capacity networks
- Network Flow and Testing Graph Connectivity
- Scaling algorithms for weighted matching in general graphs
- Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
Cited in
(4)
This page was built for publication: Efficient algorithms for geometric partial matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088931)
