Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time.
Danupon NanongkaiThatchaphol SaranurakChristian Wulff-NilsenPublished in: FOCS (2017)
Keyphrases
- worst case
- lower bound
- dynamically updated
- dynamic environments
- np hard
- average case
- upper bound
- feature selection
- multiscale
- database
- social networks
- dynamically changing
- real time
- online learning
- machine learning
- multi class
- information retrieval
- multiresolution
- genetic algorithm
- computational complexity
- decision trees
- clustering algorithm