Approximation Algorithms for the Joint Replenishment Problem with Deadlines.
Marcin BienkowskiJaroslaw ByrkaMarek ChrobakNeil B. DobbsTomasz NowickiMaxim SviridenkoGrzegorz SwirszczNeal E. YoungPublished in: ICALP (1) (2013)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- vertex cover
- precedence constraints
- facility location problem
- set cover
- primal dual
- network design problem
- np hardness
- approximation ratio
- approximation schemes
- randomized algorithms
- genetic algorithm
- open shop
- undirected graph
- spanning tree
- combinatorial auctions
- integer programming
- disjoint paths