Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.
Waldo GálvezFabrizio GrandoniArindam KhanDiego Ramírez-RomeroAndreas WiesePublished in: SoCG (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- worst case
- network design problem
- facility location problem
- packing problem
- exact algorithms
- optimal solution
- knapsack problem
- dynamic programming
- approximation ratio
- primal dual
- approximation schemes
- set cover
- constant factor
- open shop
- disjoint paths
- np hardness
- precedence constraints