An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets.
Petr A. GolovachPinar HeggernesDieter KratschYngve VillangerPublished in: Algorithmica (2015)
Keyphrases
- computational complexity
- worst case
- single pass
- experimental evaluation
- detection algorithm
- optimization algorithm
- cost function
- learning algorithm
- preprocessing
- theoretical analysis
- times faster
- recognition algorithm
- k means
- objective function
- matching algorithm
- approximation ratio
- multiscale
- np hard
- significant improvement
- optimal solution
- expectation maximization
- high accuracy
- dynamic programming
- shortest path
- multi objective
- incremental learning
- search space
- strongly polynomial