AI Paper Atlas

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

NeurIPS 2026 · Learning theory and algorithms › Sample complexity · approach: Private and query-efficient algorithms

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

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy