Computing variance for interval data is NP-hard.

Scott Ferson Lev Ginzburg Vladik Kreinovich Luc Longpré Monica Aviles

Published in: SIGACT News (2002)

Keyphrases

interval data
np hard
minmax regret
shortest path problem
temporal data
linear programming
scheduling problem
special case
data clustering
optimal solution
computational complexity
lower bound
shortest path
multivariate data
data sets
branch and bound algorithm
approximation algorithms
data analysis
image sequences