On the computational complexity of the virtual network embedding problem
From MaRDI portal
Recommendations
- Compact and extended formulations for the virtual network embedding problem
- A branch-and-price algorithm for the single-path virtual network embedding problem
- Resource competition in virtual network embedding
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- Competitive and deterministic embeddings of virtual networks
Cites work
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- A survey of network virtualization
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Finding Large Clique Minors is Hard
- Some simplified NP-complete graph problems
- The complexity of the 0/1 multi-knapsack problem
- Virtual network provisioning across multiple substrate networks
Cited in
(8)- Benders decomposition for a node-capacitated virtual network function placement and routing problem
- Adversarial topology discovery in network virtualization environments: a threat for ISPs?
- A branch-and-price algorithm for the single-path virtual network embedding problem
- Compact and extended formulations for the virtual network embedding problem
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation
- Graph-based specification and automated construction of ILP problems
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines
- scientific article; zbMATH DE number 1487924 (Why is no real title available?)
This page was built for publication: On the computational complexity of the virtual network embedding problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q325446)
