scientific article; zbMATH DE number 1305475
From MaRDI portal
Publication:4252363
Recommendations
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- 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
- scientific article; zbMATH DE number 1003267
Cited in
(29)- Aggregation error for location models: Survey and analysis
- Matching point sets with respect to the earth mover's distance
- On the computational complexity of the bipartizing matching problem
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
- Improved bounds for bipartite matching on surfaces
- scientific article; zbMATH DE number 6381629 (Why is no real title available?)
- Linear-time approximation for maximum weight matching
- Fast and Simple Algorithms for Weighted Perfect Matching
- A Monte Carlo solution to the minimal Euclidean matching
- scientific article; zbMATH DE number 3965443 (Why is no real title available?)
- On bipartite matchings of minimum density
- Bijective comparison of optimal planarity algorithms
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching Instances
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
- Approximation algorithms for bipartite matching with metric and geometric costs
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Algorithms for the transportation problem in geometric settings
- Computing fair and bottleneck matchings in geometric graphs
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- An o(n n)-time approximation scheme for geometric many-to-many matching
- Fast approximation algorithms for Euclidean minimum weight perfect matching
- Fast approximation algorithms for Euclidean minimum weight perfect matching
- Parallel complexity of geometric bipartite matching
- Restricted matching in plane triangulations and near triangulations
- An 0(n log n) algorithm for the convex bipartite matching problem
- Approximating the bottleneck plane perfect matching of a point set
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4252363)
