Assessing an approximation algorithm for the minimum fill-in problem in practice.
H. Martin BückerMichael LülfesmannArno RaschPublished in: Combinatorial Scientific Computing (2009)
Keyphrases
- np hard
- high accuracy
- theoretical analysis
- dynamic programming
- improved algorithm
- matching algorithm
- search space
- detection algorithm
- experimental evaluation
- computational cost
- square error
- times faster
- classification algorithm
- computationally efficient
- particle swarm optimization
- linear programming
- approximation ratio
- k means
- optimal solution
- learning algorithm
- probabilistic model
- expectation maximization
- cost function
- segmentation algorithm
- preprocessing
- global minimum
- minimum cost
- randomized algorithm
- maximum likelihood
- approximation algorithms
- closed form
- worst case
- significant improvement
- objective function
- decision trees