On the computational complexity of the virtual network embedding problem

Given a graph representing a substrate (or physical) network with node and edge capacities and a set of virtual networks with node capacity demands and node-to-node traffic demands, the Virtual Network Embedding problem (VNE) calls for an embedding of (a subset of) the virtual networks onto the subs...

Full description

Bibliographic Details

Published in:	Electronic notes in discrete mathematics Vol. 52; pp. 213 - 220
Main Authors:	Amaldi, Edoardo, Coniglio, Stefano, Koster, Arie M.C.A., Tieves, Martin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.06.2016
Subjects:	combinatorial optimization computational complexity inapproximability Virtual network embedding combinatorial optimization inapproximability Virtual network embedding computational complexity
ISSN:	1571-0653, 1571-0653
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!