Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing.
Arindam KhanEklavya SharmaK. V. N. SreenivasPublished in: FSTTCS (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- approximation ratio
- open shop
- randomized algorithms
- facility location problem
- np hardness
- network design problem
- set cover
- primal dual
- precedence constraints
- polynomial time approximation
- approximation schemes
- exact algorithms
- constant factor
- undirected graph
- disjoint paths
- optimal solution
- packing problem
- dynamic programming