A linear-time approximation algorithm for weighted matchings in graphs.
Doratha E. Drake VinkemeierStefan HougardyPublished in: ACM Trans. Algorithms (2005)
Keyphrases
- worst case
- error bounds
- detection algorithm
- optimal solution
- cost function
- np hard
- computational complexity
- graph isomorphism
- computational cost
- clustering method
- max cut
- graph structure
- objective function
- optimization algorithm
- expectation maximization
- tree structure
- closed form
- convergence rate
- weighted graph
- undirected graph
- weight function
- polynomial time approximation
- k means
- search space
- simple polygon