An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets.

Lucio Bianco Paolo Dell'Olmo Stefano Giordani

Published in: Comput. Optim. Appl. (1997)

Keyphrases

dynamic programming
computational complexity
space complexity
learning algorithm
worst case
k means
optimal solution
memory requirements
np hard
convex hull
search space
lower bound
principal component analysis
dimensionality reduction
input data
closed form
feature extraction