A Faster Algorithm for the Steiner Tree Problem.
Daniel MölleStefan RichterPeter RossmanithPublished in: STACS (2006)
Keyphrases
- learning algorithm
- detection algorithm
- worst case
- experimental evaluation
- preprocessing
- improved algorithm
- matching algorithm
- times faster
- np hard
- dynamic programming
- computational complexity
- k means
- data sets
- optimization algorithm
- expectation maximization
- cost function
- search space
- computationally efficient
- theoretical analysis
- computational cost
- significant improvement
- single pass
- simulated annealing
- least squares
- segmentation algorithm
- probabilistic model
- recognition algorithm
- weighted graph
- highly efficient