{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:07:20Z","timestamp":1759133240233},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T00:00:00Z","timestamp":1633305600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T00:00:00Z","timestamp":1633305600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T00:00:00Z","timestamp":1633305600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,10,4]]},"DOI":"10.1109\/lcn52139.2021.9524975","type":"proceedings-article","created":{"date-parts":[[2021,9,7]],"date-time":"2021-09-07T19:37:11Z","timestamp":1631043431000},"page":"605-612","source":"Crossref","is-referenced-by-count":3,"title":["Improved Monte Carlo Tree Search for Virtual Network Embedding"],"prefix":"10.1109","author":[{"given":"Maxime","family":"Elkael","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hind","family":"Castel-Taleb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Badii","family":"Jouaber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Araldo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massinissa Ait","family":"Aba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOMW.2019.8845171"},{"journal-title":"ECAI 2020","article-title":"Monte Carlo Vehicle Routing","year":"2020","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355737"},{"journal-title":"Reinforcement Learning An Introduction","year":"2018","author":"sutton","key":"ref13"},{"journal-title":"TS 23 501 System Architecture for the 5G System v15 0 0","year":"0","key":"ref14"},{"key":"ref15","article-title":"Monte carlo vehicle routing","author":"cazenave","year":"2020","journal-title":"ECAI 2020"},{"article-title":"Monte Carlo Inverse Folding","year":"2020","author":"cazenave","key":"ref16"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-89453-5_2","article-title":"Stabilized nested rollout policy adaptation","author":"cazenave","year":"2021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2946949"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2017.01.051"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1971162.1971168"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2159308"},{"article-title":"$\\mathcal{N}\\mathcal{P}$-Completeness and Inapproximability of the Virtual Network Embedding Problem and Its Variants","year":"2018","author":"schmid","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2013.013013.00155"},{"key":"ref8","article-title":"Nested Rollout Policy Adaptation for Monte Carlo Tree Search","author":"rosin","year":"2011","journal-title":"IJCAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.2986662"},{"key":"ref2","article-title":"Virtual Network Embedding via Monte Carlo Tree Search","author":"haeri","year":"2017","journal-title":"IEEE Transactions on Cybernetics"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2815638"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref20","article-title":"Mathematical Models of the Delay Constrained Routing Problem","author":"ben-ameur","year":"2006","journal-title":"Algorithmic Operations Research"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12963-6_4"}],"event":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","start":{"date-parts":[[2021,10,4]]},"location":"Edmonton, AB, Canada","end":{"date-parts":[[2021,10,7]]}},"container-title":["2021 IEEE 46th Conference on Local Computer Networks (LCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9524874\/9524875\/09524975.pdf?arnumber=9524975","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:45:26Z","timestamp":1652197526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9524975\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/lcn52139.2021.9524975","relation":{},"subject":[],"published":{"date-parts":[[2021,10,4]]}}}