Almost optimal algorithms for diameter-optimally augmenting trees.
Davide BilòPublished in: CoRR (2018)
Keyphrases
- worst case
- data structure
- orders of magnitude
- computational cost
- theoretical analysis
- learning algorithm
- computational complexity
- times faster
- dynamic programming
- computational efficiency
- binary search trees
- computationally expensive
- evolutionary algorithm
- social networks
- index structure
- benchmark datasets
- data mining techniques
- upper bound
- significant improvement
- recently developed
- exhaustive search
- optimal parameters