Fast Additive Constant Approximation Algorithms for the Safe Deposit Boxes Problem with Two and Three Currencies.
Boaz Ben-MosheYefim DinitzPublished in: CCCG (2007)
Keyphrases
- approximation algorithms
- special case
- constant factor
- np hard
- worst case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- axis parallel
- approximation ratio
- randomized algorithms
- precedence constraints
- primal dual
- exchange rate
- undirected graph
- approximation schemes
- combinatorial auctions
- open shop
- set cover
- disjoint paths
- lower bound
- np hardness
- polynomial time approximation
- branch and bound algorithm