Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items.
Arindam KhanEklavya SharmaPublished in: Algorithmica (2023)
Keyphrases
- approximation algorithms
- bin packing
- worst case
- np hard
- vertex cover
- special case
- lower bound
- graph colouring
- search tree
- approximation schemes
- minimum cost
- set cover
- primal dual
- upper bound
- greedy algorithm
- disjoint paths
- undirected graph
- approximation ratio
- packing problem
- precedence constraints
- open shop
- polynomial time approximation
- constant factor
- branch and bound algorithm
- combinatorial auctions
- genetic algorithm
- np complete
- randomized algorithms
- knapsack problem