When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks.
Ajit AgrawalPhilip N. KleinR. RaviPublished in: SIAM J. Comput. (1995)
Keyphrases
- preprocessing
- closed form
- detection algorithm
- experimental evaluation
- theoretical analysis
- computational complexity
- k means
- computational cost
- simulated annealing
- recognition algorithm
- times faster
- tree structure
- segmentation algorithm
- cost function
- significant improvement
- linear programming
- dynamic programming
- optimization algorithm
- monte carlo
- convex hull
- learning algorithm
- approximation guarantees
- minimum spanning tree
- approximation ratio
- np hard
- search space
- similarity measure