An Eight-Approximation Algorithm for Computing Rooted Three-Vertex Connected Minimum Steiner Networks.
Hong ShenLongkun GuoPublished in: IEEE Trans. Computers (2013)
Keyphrases
- polynomial time approximation
- np hard
- lower bound
- worst case
- computational complexity
- approximation guarantees
- dynamic programming
- cost function
- times faster
- shortest path
- detection algorithm
- simulated annealing
- neural network
- significant improvement
- search space
- preprocessing
- similarity measure
- clustering algorithm
- learning algorithm