scientific article; zbMATH DE number 7650079
From MaRDI portal
Publication:5875463
Cites work
- scientific article; zbMATH DE number 6381629 (Why is no real title available?)
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- scientific article; zbMATH DE number 7250154 (Why is no real title available?)
- scientific article; zbMATH DE number 7650079 (Why is no real title available?)
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- A new algorithm for optimal 2-constraint satisfaction and its implications
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Combinatorial optimization. Abstracts from the workshop held November 4--10, 2018
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Faster algorithms for the geometric transportation problem
- Hardness of approximate nearest neighbor search
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
- On some fine-grained questions in algorithms and complexity
- On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity
- Parallel algorithms for geometric graph problems
- Preconditioning for the Geometric Transportation Problem
- The earth mover's distance as a metric for image retrieval
- Wasserstein discriminant analysis
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 Q5875463)
