Steiner tree reoptimization in graphs with sharpened triangle inequality.
Hans-Joachim BöckenhauerKarin FreiermuthJuraj HromkovicTobias MömkeAndreas SprockBjörn SteffenPublished in: J. Discrete Algorithms (2012)
Keyphrases
- triangle inequality
- steiner tree
- minimum spanning tree
- edge weights
- similarity search
- distance function
- quadratic assignment problem
- nearest neighbor
- edit distance
- graph matching
- spanning tree
- distance measure
- metric space
- dissimilarity measure
- distance metric
- shortest path
- weighted graph
- graph theory
- similarity function
- nearest neighbor search
- pre computed
- facility location
- undirected graph
- bipartite graph
- similarity queries
- directed graph
- high dimensional
- linear programming relaxation
- knn
- graph structure
- traveling salesman problem