Approximation Algorithms for Inventory Problems with Submodular or Routing Costs.
Viswanath NagarajanCong ShiPublished in: CoRR (2015)
Keyphrases
- approximation algorithms
- vertex cover
- approximation schemes
- np hard
- randomized algorithms
- np hardness
- exact algorithms
- optimization problems
- set cover
- network design problem
- primal dual
- special case
- total cost
- minimum cost
- approximation ratio
- worst case
- objective function
- greedy algorithm
- combinatorial optimization
- shortest path
- supply chain
- open shop
- disjoint paths