Approximation Algorithms for Max-Morse Matching.
Abhishek RathodTalha Bin MasoodVijay NatarajanPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- facility location problem
- primal dual
- open shop
- approximation ratio
- graph matching
- randomized algorithms
- approximation schemes
- exact algorithms
- undirected graph
- np hardness
- strongly np hard
- convergence rate
- dynamic programming