On the computational complexity of the virtual network embedding problem

Andersen, 2002

Chowdhury, 2010, A survey of network virtualization, Computer Networks, 54, 862, 10.1016/j.comnet.2009.10.017

Coniglio

Coniglio, 2015, Virtual network embedding under uncertainty: exact and heuristic approaches

Eppstein, 2009, Finding large clique minors is hard, Journal of Graph Algorithms and Applications, 13, 197, 10.7155/jgaa.00183

Garey, 1976, Some simplified NP-complete graph problems, Theoretical computer science, 1, 237, 10.1016/0304-3975(76)90059-1

Geng, 1986, The complexity of the 0-1 multi-knapsack problem, Journal of Computer Science and Technology, 1, 46, 10.1007/BF02943300

Hastad, 1999, Clique is hard to approximate within n1−ϵ, Acta Mathematica, 182, 105, 10.1007/BF02392825

Houidi, 2011, Virtual network provisioning across multiple substrate networks, Computer Networks, 55, 1011, 10.1016/j.comnet.2010.12.011

Poljak, 1974, A note on stable sets and coloring of graphs, Commentationes Mathematicae Universitatis Carolinae, 15, 307

Yu, 2008, Rethinking virtual network embedding: substrate support for path splitting and migration, ACM SIGCOMM Computer Communication Review, 38, 17, 10.1145/1355734.1355737

Zhu, 2006, Algorithms for assigning substrate network resources to virtual network components, 1