Approximation Algorithms for Rectangle Packing Problems (PhD Thesis).
Salvatore IngalaPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- phd thesis
- packing problem
- np hard
- integer programming
- special case
- bin packing
- worst case
- minimum cost
- primal dual
- vertex cover
- approximation schemes
- facility location problem
- open shop
- cutting stock
- constant factor
- randomized algorithms
- set cover
- network design problem
- approximation ratio
- precedence constraints
- dc programming
- upper bound
- constant factor approximation
- constraint programming