Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing.
Arindam KhanEklavya SharmaK. V. N. SreenivasPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- facility location problem
- network design problem
- approximation ratio
- open shop
- exact algorithms
- undirected graph
- randomized algorithms
- np hardness
- approximation schemes
- primal dual
- packing problem
- set cover
- constant factor
- genetic algorithm
- strongly np hard
- linear programming
- disjoint paths