A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
From MaRDI portal
Publication:5088980
Recommendations
- A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
- Weighted Bipartite Matching in Matrix Multiplication Time
- Maximum weight bipartite matching in matrix multiplication time
- Experimental and Efficient Algorithms
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
Cites work
- scientific article; zbMATH DE number 3231693 (Why is no real title available?)
- A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- A faster algorithm for minimum-cost bipartite perfect matching in planar graphs
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
- Algorithms for the transportation problem in geometric settings
- Algorithms – ESA 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximation algorithms for bipartite matching with metric and geometric costs
- Faster Scaling Algorithms for Network Problems
- Faster algorithms for the geometric transportation problem
- Geometry helps in bottleneck matching and related problems
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
- The weighted matching approach to maximum cardinality matching
This page was built for publication: A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088980)
