Approximation algorithms for inventory problems with submodular or routing costs.

Viswanath Nagarajan Cong Shi

Published in: Math. Program. (2016)

Keyphrases

approximation algorithms
vertex cover
approximation schemes
np hard
special case
network design problem
randomized algorithms
total cost
np hardness
constant factor
greedy algorithm
exact algorithms
lot sizing
set cover
approximation guarantees
open shop