A 2/3-approximation algorithm for vertex-weighted matching.
Ahmed Al-HerzAlex PothenPublished in: Discret. Appl. Math. (2022)
Keyphrases
- theoretical analysis
- significant improvement
- computational cost
- matching algorithm
- dynamic programming
- high accuracy
- cost function
- np hard
- worst case
- learning algorithm
- times faster
- optimization algorithm
- experimental evaluation
- neural network
- probabilistic model
- computational complexity
- detection algorithm
- search space
- preprocessing
- expectation maximization
- segmentation algorithm
- optimal solution
- keypoints
- objective function
- closed form
- string matching
- matching scheme
- maximum cardinality