A polynomial time algorithm for the 2-Poset Cover Problem.
Ivy OrdanelProceso FernandezHenry N. AdornaPublished in: Inf. Process. Lett. (2021)
Keyphrases
- computational complexity
- dynamic programming
- experimental evaluation
- worst case
- optimization algorithm
- improved algorithm
- detection algorithm
- theoretical analysis
- simulated annealing
- computational cost
- cost function
- search space
- preprocessing
- similarity measure
- learning algorithm
- data sets
- space complexity
- matching algorithm
- approximation algorithms
- segmentation algorithm
- computationally efficient
- particle swarm optimization
- probabilistic model
- np hard
- special case
- k means
- objective function
- decision trees
- neural network