Approximation Algorithms for The Generalized Incremental Knapsack Problem.
Yuri FaenzaDanny SegevLingyi ZhangPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- knapsack problem
- np hard
- exact algorithms
- combinatorial optimization problems
- special case
- optimal solution
- vertex cover
- minimum cost
- worst case
- multidimensional knapsack problem
- optimization problems
- primal dual
- approximation ratio
- greedy algorithm
- scheduling problem
- linear programming relaxation
- set cover
- lower bound
- open shop
- linear programming
- network design problem
- undirected graph
- constant factor
- maximum profit
- greedy heuristic
- constant factor approximation
- randomized algorithms
- branch and bound algorithm
- precedence constraints
- objective function
- production planning
- integer programming
- dynamic programming
- constraint satisfaction problems
- cutting plane
- approximation guarantees
- computational complexity
- polynomial time approximation