Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights.
Michael DinitzGuy KortsarzZeev NutovPublished in: APPROX-RANDOM (2014)
Keyphrases
- improved algorithm
- theoretical analysis
- segmentation algorithm
- optimal solution
- detection algorithm
- times faster
- computational cost
- optimization algorithm
- computational complexity
- cost function
- dynamic programming
- search algorithm
- objective function
- recognition algorithm
- closed form
- randomized algorithm
- input data
- high accuracy
- worst case
- np hard
- k means
- search space
- preprocessing
- similarity measure
- polygonal approximation
- weighted average
- minimum spanning tree
- weight function
- image segmentation
- error bounds
- matching algorithm
- monte carlo
- expectation maximization
- linear programming
- simulated annealing
- scheduling problem
- significant improvement