Structure-Aware Abstraction of Hierarchical Time Series
This work provides the first formal analysis of HTSA, proving its NP-hardness and showing that the objective is neither monotone nor submodular, and proposes OSS, whose discretized search provides a 1/alpha-approximation guarantee for each single optimal-subtree computation.