Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices.
Bang Ye WuKun-Mao ChaoChuan Yi TangPublished in: COCOON (1998)
Keyphrases
- exact algorithms
- approximation algorithms
- constant factor
- knapsack problem
- np hard
- maximum distance
- distance matrix
- vehicle routing problem with time windows
- heuristic methods
- distance measure
- combinatorial optimization
- exact solution
- tree edit distance
- decision trees
- max sat
- special case
- computational problems
- lower bound
- euclidean distance
- combinatorial optimization problems
- combinatorial problems
- worst case
- upper bound
- dynamic programming
- optimal solution
- machine learning
- benders decomposition