Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs.
Robert PreisPublished in: STACS (1999)
Keyphrases
- matching algorithm
- worst case
- computational complexity
- learning algorithm
- preprocessing
- objective function
- search space
- np hard
- dynamic programming
- graph isomorphism
- detection algorithm
- maximum weight
- approximation ratio
- graph structure
- absolute error
- image matching
- probabilistic model
- special case
- k means
- adjacency graph
- finding the shortest path
- error bounds
- closed form
- simulated annealing
- optimal solution