A heuristic approximation algorithm for the Steiner tree based on prior multicast nodes.
Weijun YangYun ZhangYuanfeng ChenJianqi LiuGenyi LiuPublished in: Int. J. Auton. Adapt. Commun. Syst. (2018)
Keyphrases
- detection algorithm
- learning algorithm
- dynamic programming
- k means
- simulated annealing
- closed form
- np hard
- computational complexity
- optimal solution
- error bounds
- graph structure
- heuristic methods
- minimum spanning tree
- bin packing
- node selection
- multicast routing
- worst case performance ratio
- randomized algorithm
- solution quality
- worst case
- evolutionary algorithm
- objective function