Approximation Algorithms for the NFV Service Distribution Problem.
Hao FengJaime LlorcaAntonia Maria TulinoDanny RazAndreas F. MolischPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- primal dual
- minimum cost
- set cover
- constant factor
- facility location problem
- disjoint paths
- open shop
- approximation schemes
- randomized algorithms
- approximation ratio
- random variables
- network design problem
- web services
- service times
- greedy algorithm