Approximation Algorithms for 3D Orthogonal Knapsack.
Florian DiedrichRolf HarrenKlaus JansenRalf ThöleHenning ThomasPublished in: TAMC (2007)
Keyphrases
- approximation algorithms
- np hard
- knapsack problem
- special case
- worst case
- minimum cost
- vertex cover
- optimal solution
- primal dual
- upper bound
- dynamic programming
- facility location problem
- approximation ratio
- network design problem
- approximation schemes
- packing problem
- exact algorithms
- set cover
- undirected graph
- np hardness
- open shop
- constant factor
- greedy heuristic
- precedence constraints
- lower bound
- linear programming
- disjoint paths
- constant factor approximation
- feasible solution
- search space
- computational complexity