Approximation algorithms in partitioning real-time tasks with replications.
Jian (Denny) LinAlbert M. K. ChengGokhan GercekPublished in: Int. J. Parallel Emergent Distributed Syst. (2018)
Keyphrases
- approximation algorithms
- real time
- np hard
- special case
- facility location problem
- vertex cover
- network design problem
- primal dual
- approximation schemes
- approximation ratio
- worst case
- minimum cost
- exact algorithms
- constant factor
- open shop
- constant factor approximation
- np hardness
- disjoint paths
- precedence constraints
- set cover
- undirected graph
- dynamic programming
- lower bound