A Simple 0.5-Bounded Greedy Algorithm for the 0/1 Knapsack Problem.
U. K. SarkarP. P. ChakrabartiSujoy GhoseS. C. De SarkarPublished in: Inf. Process. Lett. (1992)
Keyphrases
- greedy algorithm
- knapsack problem
- greedy algorithms
- combinatorial optimization problems
- dynamic programming
- greedy heuristic
- multidimensional knapsack problem
- objective function
- linear programming relaxation
- exact algorithms
- set cover
- worst case
- influence maximization
- approximation guarantees
- greedy strategy
- continuous relaxation
- influence spread
- maximum profit
- implicit enumeration
- optimal solution