Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem.
Jian SunHaiyun ShengYuefang SunXiaoyan ZhangPublished in: AAIM (2019)
Keyphrases
- prize collecting
- dynamic programming
- learning algorithm
- cost function
- worst case
- computational complexity
- np hard
- k means
- benchmark problems
- error bounds
- monte carlo
- convex hull
- optimization algorithm
- expectation maximization
- particle swarm optimization
- ant colony optimization
- computational efficiency
- combinatorial optimization
- greedy algorithm
- convergence rate
- objective function
- polygonal approximation
- multicast routing
- neural network