A Fast Hop-Biased Approximation Algorithm for the Quadratic Group Steiner Tree Problem.
Xiaoqing WangGong ChengPublished in: WWW (2024)
Keyphrases
- optimal solution
- computational cost
- dynamic programming
- prize collecting
- objective function
- computational complexity
- optimization algorithm
- search space
- learning algorithm
- recognition algorithm
- closed form
- experimental evaluation
- significant improvement
- worst case
- high accuracy
- segmentation algorithm
- detection algorithm
- matching algorithm
- preprocessing
- times faster
- convergence rate
- neural network
- np hard
- linear computational complexity
- polygonal approximation
- improved algorithm
- feature selection
- ant colony optimization
- pairwise
- computationally efficient
- particle swarm optimization