AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

Efficient algorithms for Incremental Metric Bipartite Matching

Ritesh Seth, Mrinal Garg, Sujoy Bhore, Sharath Raghvendra, Syamantak Das

ICLR 2026 · Learning theory and algorithms › Optimal transport · approach: Wasserstein barycenters and GW

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use Batch Incremental PR instead of GreedyGreedy · Beijing Road Networkmatching costImproved
use Batch Incremental PR instead of GreedyGreedy · MNISTruntime and costImproved
use Batch Incremental PR instead of QT and Dynamic EuclideanQT / Dynamic Euclidean · NYC-Taximatching costImproved
use Batch Incremental PR instead of QT and Dynamic EuclideanQT / Dynamic Euclidean · NYC-TaxiruntimeHurt
use Batch Incremental PR instead of Greedy with more than 7,000 pointsGreedy · Beijing Road Networkruntime: outperforms greedy till about 7,000 data pointsHurt
use Batch Incremental PR instead of QT and Dynamic EuclideanQT / Dynamic Euclidean · Syntheticmatching costImproved

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