A Polynomial Time Algorithm for Unidimensional Unfolding Representations.
Jean-Paul DoignonJean-Claude FalmagnePublished in: J. Algorithms (1994)
Keyphrases
- computational complexity
- learning algorithm
- times faster
- dynamic programming
- cost function
- experimental evaluation
- detection algorithm
- high accuracy
- worst case
- preprocessing
- optimal solution
- expectation maximization
- computationally efficient
- clustering method
- k means
- search space
- matching algorithm
- objective function
- genetic algorithm
- strongly polynomial
- min cost
- space complexity
- np complete
- input data
- scheduling problem
- computational cost
- special case