A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching.
Eugenio AngrimanMichal BoronHenning MeyerhenkePublished in: ACM J. Exp. Algorithmics (2022)
Keyphrases
- matching algorithm
- learning algorithm
- preprocessing
- optimization algorithm
- dynamic programming
- recognition algorithm
- times faster
- experimental evaluation
- neural network
- cost function
- np hard
- high accuracy
- matching process
- detection algorithm
- computational cost
- significant improvement
- k means
- optimal solution
- linear programming
- input data
- theoretical analysis
- worst case
- feature selection