An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets.
Petr A. GolovachPinar HeggernesDieter KratschYngve VillangerPublished in: ICALP (1) (2013)
Keyphrases
- decision trees
- worst case
- learning algorithm
- recognition algorithm
- computational complexity
- computational cost
- np hard
- optimization algorithm
- experimental evaluation
- single pass
- detection algorithm
- times faster
- dynamic programming
- search space
- optimal solution
- expectation maximization
- incremental version
- incremental learning
- matching algorithm
- segmentation algorithm
- simulated annealing
- high accuracy
- special case
- significant improvement
- preprocessing
- similarity measure
- particle swarm optimization
- linear programming
- cost function
- incremental algorithms