Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing.
Arindam KhanAditya LonkarArnab MaitiAmatya SharmaAndreas WiesePublished in: ICALP (2022)
Keyphrases
- approximation algorithms
- worst case
- strip packing
- np hard
- special case
- lower bound
- vertex cover
- upper bound
- three dimensional
- primal dual
- set cover
- minimum cost
- open shop
- exact algorithms
- knapsack problem
- np hardness
- facility location problem
- constant factor
- approximation schemes
- evolutionary algorithm
- error bounds
- computational complexity
- polynomial time approximation
- greedy algorithm
- constant factor approximation
- approximation ratio
- undirected graph
- randomized algorithms
- approximation guarantees
- precedence constraints
- branch and bound
- disjoint paths
- optimal solution