Approximation algorithms for Max Morse Matching.
Abhishek RathodTalha Bin MasoodVijay NatarajanPublished in: Comput. Geom. (2017)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- network design problem
- minimum cost
- open shop
- facility location problem
- primal dual
- set cover
- exact algorithms
- approximation ratio
- approximation schemes
- randomized algorithms
- optimization problems
- np hardness
- feature points
- polynomial time approximation
- undirected graph
- search algorithm
- combinatorial auctions
- graph matching
- partial order
- approximation guarantees
- simulated annealing
- disjoint paths