Research map / Graph learning / Graph algorithms and clustering
The Computational Complexity of Weighted Greedy Matching
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
- Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information (AAAI 2016 · similarity 0.90)
- Distributed Weighted Matching via Randomized Composable Coresets (ICML 2019 · similarity 0.89)
- Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS (ICML 2024 · similarity 0.88)
- Proportionally Fair Matching via Randomized Rounding (AAAI 2025 · similarity 0.86)
- FRAM: Frobenius-Regularized Assignment Matching with Mixed-Precision Computing (NeurIPS 2025 · similarity 0.86)
- A Fast Exact Solver with Theoretical Analysis for the Maximum Edge-Weighted Clique Problem (AAAI 2024 · similarity 0.86)
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.