An approximation algorithm for the -prize-collecting multicut problem in trees with submodular penalties.
Xiaofei LiuWeidong LiPublished in: Math. Struct. Comput. Sci. (2024)
Keyphrases
- dynamic programming
- objective function
- prize collecting
- learning algorithm
- cost function
- optimal solution
- scheduling problem
- computational complexity
- optimization algorithm
- tree structure
- k means
- benchmark problems
- worst case
- knapsack problem
- simulated annealing
- unordered trees
- search strategy
- convergence rate
- np hard
- multi objective
- search space