Tight Approximation Algorithms for Two Dimensional Guillotine Strip Packing.
Arindam KhanAditya LonkarArnab MaitiAmatya SharmaAndreas WiesePublished in: CoRR (2022)
Keyphrases
- approximation algorithms
- worst case
- strip packing
- np hard
- lower bound
- three dimensional
- special case
- upper bound
- knapsack problem
- network design problem
- vertex cover
- facility location problem
- minimum cost
- approximation ratio
- approximation schemes
- primal dual
- exact algorithms
- np hardness
- error bounds
- constant factor approximation
- disjoint paths
- randomized algorithms
- set cover
- undirected graph
- combinatorial auctions
- greedy algorithm
- precedence constraints
- open shop
- genetic algorithm
- scheduling problem
- constant factor
- objective function