Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
Bang Ye WuKun-Mao ChaoChuan Yi TangPublished in: J. Comb. Optim. (1999)
Keyphrases
- exact algorithms
- approximation algorithms
- constant factor
- knapsack problem
- vehicle routing problem with time windows
- maximum distance
- distance matrix
- special case
- tree edit distance
- decision trees
- np hard
- benders decomposition
- computational problems
- exact solution
- combinatorial optimization problems
- combinatorial optimization
- heuristic methods
- distance measure
- worst case
- combinatorial problems
- singular value decomposition
- greedy algorithm
- network design problem
- euclidean distance
- particle swarm optimization
- information retrieval systems
- lower bound