Pages that link to "Item:Q325446"
From MaRDI portal
The following pages link to On the computational complexity of the virtual network embedding problem (Q325446):
Displaying 6 items.
- Virtual network embedding: a hybrid vertex mapping solution for dynamic resource allocation (Q693801) (← links)
- A Lagrange decomposition based branch and bound algorithm for the optimal mapping of cloud virtual machines (Q1728470) (← links)
- Compact and extended formulations for the virtual network embedding problem (Q1742226) (← links)
- Adversarial topology discovery in network virtualization environments: a threat for ISPs? (Q2353249) (← links)
- Benders decomposition for a node-capacitated virtual network function placement and routing problem (Q2668658) (← links)
- (Q4494463) (← links)