An approximation algorithm for submodular hitting set problem with linear penalties.
Shaojing DuSuogang GaoBo HouWen LiuPublished in: J. Comb. Optim. (2020)
Keyphrases
- error tolerance
- preprocessing
- experimental evaluation
- dynamic programming
- learning algorithm
- initial set
- improved algorithm
- detection algorithm
- optimal solution
- linear complexity
- recognition algorithm
- computational complexity
- error bounds
- input data
- cost function
- solution space
- convex hull
- optimization algorithm
- worst case
- theoretical analysis
- energy function
- matching algorithm
- convergence rate
- linear space
- significant improvement
- decomposition algorithm
- k means
- genetic algorithm
- sparse approximation
- stationary points
- approximation ratio
- decision trees
- reinforcement learning
- computational cost
- greedy algorithm
- probabilistic model
- simulated annealing