A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem.
Marcelo C. P. SantosLúcia M. A. DrummondEduardo UchoaPublished in: Oper. Res. Lett. (2010)
Keyphrases
- preprocessing
- learning algorithm
- objective function
- optimal solution
- selection algorithm
- segmentation algorithm
- multicast routing
- minimum spanning tree
- optimization algorithm
- distributed systems
- computational cost
- experimental evaluation
- np hard
- k means
- high accuracy
- search space
- tree structure
- data sets
- dynamic programming
- computationally efficient
- theoretical analysis
- detection algorithm
- times faster
- computational complexity
- image sequences