A Polynomial Approximation Algorithm for the Minimum Fill-In Problem.

Assaf Natanzon Ron Shamir Roded Sharan

Published in: SIAM J. Comput. (2000)

Keyphrases

cost function
dynamic programming
computational complexity
preprocessing
polynomial approximation
objective function
optimal solution
search space
learning algorithm
spanning tree
detection algorithm
square error
recognition algorithm
np hard
k means
evolutionary algorithm
error rate
upper bound