scientific article; zbMATH DE number 6381629
From MaRDI portal
Publication:2934580
Recommendations
- A near-linear constant-factor approximation for Euclidean bipartite matching?
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching
- Approximation algorithms for bipartite matching with metric and geometric costs
- scientific article; zbMATH DE number 1305475
- A lower bound to the complexity of Euclidean and rectilinear matching algorithms
- Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs
- Approximation algorithms for the Euclidean bipartite TSP
- A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs
Cited in
(14)- No-collision transportation maps
- FPTAS for minimizing the earth mover's distance under rigid transformations and related problems
- Linear transformation distance for bichromatic matchings
- On geometric prototype and applications
- Preconditioning for the Geometric Transportation Problem
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Algorithms for the transportation problem in geometric settings
- scientific article; zbMATH DE number 7650079 (Why is no real title available?)
- Sublinear time algorithms for earth mover's distance
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- Fine-grained complexity of Earth mover's distance under translation
- An o(n n)-time approximation scheme for geometric many-to-many matching
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 Q2934580)
