The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability.
Miroslav RadaMichal CernýOndrej SokolPublished in: Comput. Complex. (2024)
Keyphrases
- np hard
- interval data
- minmax regret
- special case
- np complete
- worst case
- shortest path problem
- approximation algorithms
- computational complexity
- data clustering
- lower bound
- branch and bound algorithm
- optimal solution
- integer programming
- scheduling problem
- probability distribution
- linear programming
- knapsack problem
- lagrangian relaxation
- shortest path
- data sets
- multivariate data
- multi objective
- temporal data
- optimization problems