An approximation algorithm for the submodular multicut problem in trees with linear penalties.
Chenfei HouSuogang GaoWen LiuWeili WuDing-Zhu DuBo HouPublished in: Optim. Lett. (2021)
Keyphrases
- learning algorithm
- detection algorithm
- theoretical analysis
- k means
- closed form
- high accuracy
- objective function
- error tolerance
- approximation ratio
- dynamic programming
- tree structure
- computational cost
- improved algorithm
- convergence rate
- greedy algorithm
- convex hull
- energy function
- decision trees
- computational complexity
- optimal solution
- optimization algorithm
- preprocessing
- experimental evaluation
- cost function
- combinatorial optimization
- search space
- linear programming
- search algorithm
- linear systems
- piecewise constant
- linear complexity
- data structure
- randomized algorithm
- boolean expressions
- segmentation algorithm