{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:55:28Z","timestamp":1763643328617,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund (ERDF) through the Centre\u2019s Regional Operational Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"National Funds through Funda\u00e7\u00e3o para a Ci\u00eancia e Tecnologia","doi-asserted-by":"publisher","award":["CENTRO-01-0145-FEDER-029312"],"award-info":[{"award-number":["CENTRO-01-0145-FEDER-029312"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3122024","type":"journal-article","created":{"date-parts":[[2021,10,29]],"date-time":"2021-10-29T19:25:39Z","timestamp":1635535539000},"page":"144927-144939","source":"Crossref","is-referenced-by-count":6,"title":["Determining the Minimum Cost Steiner Tree for Delay Constrained Problems"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6534-0159","authenticated-orcid":false,"given":"Lucia","family":"Martins","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0368-2222","authenticated-orcid":false,"given":"Dorabella","family":"Santos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3084-5608","authenticated-orcid":false,"given":"Teresa","family":"Gomes","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2331-8340","authenticated-orcid":false,"given":"Rita","family":"Girao-Silva","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2979072"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218381"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2016.7470849"},{"key":"ref13","first-page":"54","article-title":"Combined control and data plane robustness of SDN networks against malicious node attacks","author":"santos","year":"2018","journal-title":"Proc CNSM"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.008"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/90.234851"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(98)00208-4"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/90.720901"},{"key":"ref18","first-page":"573","article-title":"An approximate solution for the Steiner problem in graphs","volume":"24","author":"takahashi","year":"1980","journal-title":"Math Japonica"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-012-9198-2"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170203"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.06.003"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758765"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/6729"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.20274"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1002\/net.20371","article-title":"SNDlib 1.0-survivable network design library","volume":"55","author":"orlowski","year":"2010","journal-title":"Networks"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018967121276","article-title":"The Steiner tree problem with hop constraints","volume":"86","author":"vo\u00df","year":"1999","journal-title":"Ann Oper Res"},{"key":"ref8","first-page":"378","article-title":"Energy-saving routing algorithm using Steiner tree","author":"matsuura","year":"2013","journal-title":"Proc IFIP\/IEEE Int Symp Integr Netw Manage"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2009.09.008"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/net.22005"},{"key":"ref9","first-page":"527","article-title":"On min-power Steiner tree","volume":"7501","author":"grandoni","year":"2012","journal-title":"Algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800113.803626"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3489"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.7494\/csci.2019.20.2.3131"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2404440"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17461-2_20"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/QSHINE.2004.15"},{"journal-title":"IBM ILOG CPLEX Optimization Studio V12 6","year":"2013","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9611-2"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09583293.pdf?arnumber=9583293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T23:35:48Z","timestamp":1699745748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9583293\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3122024","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}