(FPT-)Approximation Algorithms for the Virtual Network Embedding Problem.
Matthias RostStefan SchmidPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- network design problem
- np hard
- special case
- minimum cost
- approximation ratio
- vertex cover
- worst case
- set cover
- exact algorithms
- facility location problem
- constant factor
- randomized algorithms
- undirected graph
- approximation schemes
- precedence constraints
- np hardness
- network structure
- disjoint paths
- open shop
- complex networks
- spanning tree
- network flow
- constant factor approximation