{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T16:48:35Z","timestamp":1783183715281,"version":"3.54.6"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"BMBF Software Campus","award":["01IS1205"],"award-info":[{"award-number":["01IS1205"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-StG-679158"],"award-info":[{"award-number":["ERC-StG-679158"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC-COG-864228"],"award-info":[{"award-number":["ERC-COG-864228"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/tnet.2020.2975646","type":"journal-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T00:13:21Z","timestamp":1583453601000},"page":"791-803","source":"Crossref","is-referenced-by-count":45,"title":["On the Hardness and Inapproximability of Virtual Network Embeddings"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2380-0284","authenticated-orcid":false,"given":"Matthias","family":"Rost","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.14"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/UCC.2012.7"},{"key":"ref12","first-page":"378","article-title":"Security-aware optimal resource allocation for virtual network embedding","author":"bays","year":"2012","journal-title":"Proc of 8th International Conf on Network and Service Management (CNSM)"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-642-21527-8_14","article-title":"Introducing the virtual network mapping problem with delay, routing and location constraints","author":"inf\u00fchr","year":"2011","journal-title":"Network Optimization"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-319-48314-6_24","article-title":"An approximation algorithm for path computation and function placement in SDNS","author":"even","year":"2016","journal-title":"Structural Information and Communication Complexity"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2939950"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3314212.3314214"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250816"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/9789812777638_0014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CloudNet.2014.6968961"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01190507"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.17487\/RFC7665"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159308"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2805789.2805792"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2378956.2378964"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.10.036"},{"key":"ref1","first-page":"1","article-title":"Charting the complexity landscape of virtual network embeddings","author":"rost","year":"2018","journal-title":"Proc IFIP Netw Conf"},{"key":"ref20","author":"andersen","year":"2002","journal-title":"Theoretical approaches to node assignment"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230569"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2016.03.028"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322287"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2556670"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090"},{"key":"ref25","first-page":"85","author":"karp","year":"1972","journal-title":"Reducibility Among Combinatorial Problems"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9069346\/09025750.pdf?arnumber=9025750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:42:26Z","timestamp":1651070546000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9025750\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":27,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2020.2975646","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}