Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items.
Arindam KhanEklavya SharmaPublished in: APPROX-RANDOM (2021)
Keyphrases
- approximation algorithms
- bin packing
- worst case
- np hard
- special case
- lower bound
- vertex cover
- graph colouring
- upper bound
- search tree
- approximation schemes
- primal dual
- minimum cost
- randomized algorithms
- open shop
- approximation ratio
- set cover
- constant factor
- packing problem
- precedence constraints
- polynomial time approximation
- disjoint paths
- constant factor approximation
- greedy algorithm
- scheduling problem
- undirected graph
- np complete
- data points
- evolutionary algorithm
- search space