An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees.
Xiaofei LiuWeidong LiPublished in: TAMC (2022)
Keyphrases
- detection algorithm
- computational complexity
- learning algorithm
- optimal solution
- k means
- dynamic programming
- optimization algorithm
- computational efficiency
- cost function
- np hard
- particle swarm optimization
- approximation ratio
- lower and upper bounds
- convergence rate
- greedy algorithm
- error bounds
- tree structure
- ant colony optimization
- objective function