An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2.
Chia-Chen WeiSun-Yuan HsiehChia-Wei LeeSheng-Lung PengPublished in: J. Discrete Algorithms (2015)
Keyphrases
- approximation ratio
- optimal solution
- theoretical analysis
- preprocessing
- times faster
- dynamic programming
- high accuracy
- probabilistic model
- search space
- cost function
- expectation maximization
- experimental evaluation
- np hard
- detection algorithm
- segmentation algorithm
- computational complexity
- polygonal approximation
- closed form
- computational cost
- gray value
- matching algorithm
- ant colony optimization
- learning algorithm
- significant improvement
- objective function
- bayesian networks
- image segmentation