A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves.
Marcus BrazilDoreen A. ThomasJia F. WengPublished in: Networks (1999)
Keyphrases
- steiner tree
- objective function
- cost function
- arbitrary shaped
- computational complexity
- mathematical model
- worst case
- dynamic programming
- probabilistic model
- minimum spanning tree
- optimal solution
- genetic algorithm
- np hard
- shortest path
- ant colony optimization
- special case
- convergence rate
- graph structure
- search space
- image segmentation