Exact algorithm for the bottleneck 2-connected $k$-Steiner network problem
Marcus BrazilCharl J. RasDoreen A. ThomasPublished in: CoRR (2011)
Keyphrases
- dynamic programming
- cost function
- learning algorithm
- computational cost
- experimental evaluation
- k means
- detection algorithm
- search space
- particle swarm optimization
- np hard
- worst case
- convergence rate
- computationally efficient
- expectation maximization
- ant colony optimization
- classification algorithm
- improved algorithm
- significant improvement
- brute force
- preprocessing
- objective function
- path planning
- growing neural gas
- segmentation algorithm
- theoretical analysis
- peer to peer
- data sets
- social networks
- decision trees
- image sequences
- similarity measure
- computational complexity