Research map / Learning theory and algorithms / Sample complexity
Efficient Algorithms For Fully Dynamic Bipartite Matching In Metric Spaces
Pankaj Agarwal, Oliver Chubet, Sharath Raghvendra, Arian Zamani
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Maintains approximate minimum-cost bipartite matchings between two dynamic point sets in a metric space under insertions and deletions, targeting Wasserstein-p cost.
Problem
Maintaining a minimum-cost bipartite matching (Wasserstein-p cost) between two point sets A and B in a metric space under fully dynamic insertions and deletions.
Approach
Dynamic algorithms for approximate bipartite matching in metric spaces that maintain an alpha-approximate matching with efficient update time; details beyond the abstract are not available.
Closest papers by meaning
- Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time (ICML 2025 · similarity 0.89)
- Dynamic Facility Location in High Dimensional Euclidean Spaces (ICML 2024 · similarity 0.87)
- Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants (ICML 2025 · similarity 0.85)
- Competitively Consistent Clustering (ICML 2025 · similarity 0.85)
- Fully Dynamic Algorithms for Chamfer Distance (NeurIPS 2025 · similarity 0.85)
- Dynamic Metric Embedding into lp Space (ICML 2024 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
