A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching.
Taisuke IzumiNaoki KitamuraYutaro YamaguchiPublished in: SODA (2024)
Keyphrases
- maximum matching
- dynamic programming
- learning algorithm
- optimization algorithm
- search space
- computational complexity
- worst case
- optimal solution
- preprocessing
- detection algorithm
- cost function
- significant improvement
- special case
- multi agent
- supervised learning
- linear programming
- objective function
- k means
- matching algorithm
- convergence rate
- bipartite graph
- multi robot
- machine learning