Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items.
Arindam KhanEklavya SharmaPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- bin packing
- worst case
- np hard
- lower bound
- special case
- minimum cost
- graph colouring
- upper bound
- approximation schemes
- vertex cover
- packing problem
- search tree
- set cover
- randomized algorithms
- open shop
- combinatorial auctions
- branch and bound algorithm
- approximation ratio
- undirected graph
- simulated annealing
- disjoint paths