Parametrized complexity of virtual network embeddings: dynamic & linear programming approximations.
Matthias RostElias DöhneStefan SchmidPublished in: Comput. Commun. Rev. (2019)
Keyphrases
- linear programming
- dynamic networks
- peer to peer
- computational complexity
- network size
- network model
- wireless sensor networks
- network structure
- complex networks
- euclidean space
- computational cost
- network resources
- dynamic environments
- network flow
- constraint propagation
- network traffic
- data sets
- network management
- manifold learning
- communication networks
- computer networks
- upper bound
- vector space
- virtual reality
- intrusion detection
- virtual environment
- low dimensional
- dynamic programming
- response time