Research map / Learning theory and algorithms / Sample complexity
A Robust Exact Algorithm for the Euclidean Bipartite Matching Problem
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time (ICML 2025 · similarity 0.91)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.85)
- Scalable Approximation Algorithms for $p$-Wasserstein Distance and Its Variants (ICML 2025 · similarity 0.84)
- Learning-Augmented Online Bipartite Fractional Matching (NeurIPS 2025 · similarity 0.84)
- Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits (NeurIPS 2024 · similarity 0.84)
- Online bipartite matching with imperfect advice (ICML 2024 · similarity 0.84)
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.