scientific article; zbMATH DE number 7650079

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.12MaRDI QIDQ5875463

Dhruv Rohatgi

Publication date: 3 February 2023

Full work available at URL: https://arxiv.org/abs/1909.11068

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hardness of approximationfine-grained complexityearth mover distance

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Unnamed Item

Uses Software

• EMD
• Wasserstein GAN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial optimization. Abstracts from the workshop held November 4--10, 2018
• Wasserstein discriminant analysis
• The earth mover's distance as a metric for image retrieval
• A new algorithm for optimal 2-constraint satisfaction and its implications
• Convolutional wasserstein distances
• Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
• Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
• Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
• Preconditioning for the Geometric Transportation Problem
• ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
• Hardness of approximate nearest neighbor search
• Parallel algorithms for geometric graph problems
• A near-linear time ε-approximation algorithm for geometric bipartite matching
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: