A simple deterministic algorithm for symmetric submodular maximization subject to a knapsack constraint.
Georgios AmanatidisGeorgios BirmpasEvangelos MarkakisPublished in: Inf. Process. Lett. (2020)
Keyphrases
- objective function
- dynamic programming
- knapsack problem
- optimization algorithm
- learning algorithm
- theoretical analysis
- times faster
- computational cost
- optimal solution
- preprocessing
- k means
- matching algorithm
- high accuracy
- segmentation algorithm
- greedy heuristic
- detection algorithm
- computationally efficient
- worst case
- computational complexity
- particle swarm optimization
- optimization problems
- clustering method
- tree structure
- state space
- experimental evaluation
- greedy algorithm
- convergence rate
- np hard
- recognition algorithm
- improved algorithm