A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners.
Davide BilòKleitos PapadopoulosPublished in: ISAAC (2018)
Keyphrases
- tree structure
- preprocessing
- computational complexity
- experimental evaluation
- optimal solution
- improved algorithm
- times faster
- significant improvement
- learning algorithm
- binary tree
- detection algorithm
- high accuracy
- dynamic programming
- np hard
- cost function
- minimum spanning tree
- worst case
- optimization algorithm
- theoretical analysis
- particle swarm optimization
- linear programming
- computational cost
- search algorithm
- recognition algorithm
- data structure
- edge information
- spanning tree
- objective function
- similarity measure