A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching.
Taisuke IzumiNaoki KitamuraYutaro YamaguchiPublished in: CoRR (2023)
Keyphrases
- maximum matching
- worst case
- np hard
- search space
- computational complexity
- learning algorithm
- optimal solution
- detection algorithm
- optimization algorithm
- dynamic programming
- preprocessing
- objective function
- cost function
- significant improvement
- genetic algorithm
- distributed systems
- segmentation algorithm
- multi agent
- multi robot
- expectation maximization
- np complete
- random walk
- matching algorithm
- convex hull
- minimum length
- data structure