O(n) Time Algorithms for Dominating Induced Matching Problems.
Min Chih LinMichel J. MizrahiJayme Luiz SzwarcfiterPublished in: LATIN (2014)
Keyphrases
- optimization problems
- greedy algorithms
- problems in computer vision
- run times
- approximate solutions
- significant improvement
- related problems
- learning algorithm
- np hard problems
- difficult problems
- search methods
- pattern matching
- benchmark problems
- data mining tasks
- orders of magnitude
- benchmark datasets
- theoretical analysis
- computationally hard
- data mining techniques
- data mining
- combinatorial optimization
- data mining algorithms
- practical problems
- exact algorithms
- hard problems
- inference problems