scientific article; zbMATH DE number 7650079
From MaRDI portal
Publication:5875463
DOI10.4230/LIPICS.APPROX-RANDOM.2019.12MaRDI QIDQ5875463FDOQ5875463
Authors: Dhruv Rohatgi 
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1909.11068
Title of this publication is not available (Why is that?)
Cites Work
- The earth mover's distance as a metric for image retrieval
- Wasserstein discriminant analysis
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Title not available (Why is that?)
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Combinatorial optimization. Abstracts from the workshop held November 4--10, 2018
- Edit distance cannot be computed in strongly subquadratic time (unless SETH is false)
- Title not available (Why is that?)
- Faster algorithms for the geometric transportation problem
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- A near-linear time ε-approximation algorithm for geometric bipartite matching
- Parallel algorithms for geometric graph problems
- Hardness of approximate nearest neighbor search
- On some fine-grained questions in algorithms and complexity
- On the difference between closest, furthest, and orthogonal pairs: nearly-linear vs barely-subquadratic complexity
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
- Title not available (Why is that?)
- Preconditioning for the Geometric Transportation Problem
- Title not available (Why is that?)
Cited In (1)
Uses Software
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)
