On the computational complexity of the virtual network embedding problem
Authors:
- Edoardo AmaldiEAEdoardo Amaldi
- Stefano ConiglioSCStefano Coniglio
- Arie M.C.A. KosterAKArie M.C.A. Koster
- Martin TievesMTMartin Tieves
Top Cited Papers
- 1 June 2016
- journal article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 52, 213-220
Abstract
No abstract availableKeywords
Funding Information
- Bundesministerium für Forschung, Technologie und Raumfahrt (05M13PAA, 05M2013)
This publication has 7 references indexed in Scilit:
- Virtual network provisioning across multiple substrate networksComputer Networks, 2011
- A survey of network virtualizationComputer Networks, 2010
- Finding Large Clique Minors is HardJournal of Graph Algorithms and Applications, 2009
- Rethinking virtual network embeddingACM SIGCOMM Computer Communication Review, 2008
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- The complexity of the 0/1 multi-knapsack problemJournal of Computer Science and Technology, 1986
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976