Approximation algorithms for the NFV service distribution problem.
Hao FengJaime LlorcaAntonia Maria TulinoDanny RazAndreas F. MolischPublished in: INFOCOM (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- open shop
- network design problem
- disjoint paths
- facility location problem
- primal dual
- approximation ratio
- constant factor
- web services
- set cover
- undirected graph
- approximation schemes
- precedence constraints
- randomized algorithms
- np hardness
- branch and bound
- random variables
- graphical models
- constant factor approximation