Dynamic Placement of Extended Service Function Chains: Steiner-based Approximation Algorithms.
Selma KhebbacheMakhlouf HadjiDjamal ZeghlachePublished in: LCN (2018)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- network design problem
- facility location problem
- worst case
- primal dual
- web services
- set cover
- approximation ratio
- randomized algorithms
- approximation schemes
- np hardness
- dynamic programming
- polynomial time approximation
- genetic algorithm
- open shop