{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T15:07:42Z","timestamp":1730214462234,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"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":[[2019,3]]},"DOI":"10.1109\/drcn.2019.8713664","type":"proceedings-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:23:30Z","timestamp":1558027410000},"page":"138-145","source":"Crossref","is-referenced-by-count":7,"title":["Weighted Euclidean Steiner Trees for Disaster-Aware Network Design"],"prefix":"10.1109","author":[{"given":"Luis","family":"Garrote","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Martins","sequence":"additional","affiliation":[]},{"given":"Urbano J.","family":"Nunes","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Zachariasen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2014.2334713"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/net.1026"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24855-2_39"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(88)90054-9"},{"key":"ref14","article-title":"The weighted region problem: Finding shortest paths through a weighted planar subdivision","author":"mitchell","year":"1990","journal-title":"Cornell University Operations Research and Industrial Engineering Tech Rep"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/027836499000900605"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/262839.263101"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1147\/sj.41.0025"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10518-015-9795-1"},{"key":"ref4","article-title":"Determination of the minimum cost pair of d-geodiverse paths","author":"de sousa","year":"0","journal-title":"The 2017 International Conference on Design of Reliable Communication Networks (DRCN 2017 Munich March 8&#x2013;10 2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/net.21660"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-13915-9","article-title":"Optimal Interconnection Trees in the Plane: Theory, Algorithms and Applications, ser","author":"brazil","year":"2015","journal-title":"Algorithms and Combinatorics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/RNDM.2016.7608263"},{"key":"ref8","first-page":"286","author":"zachariasen","year":"1999","journal-title":"Obstacle-Avoiding Euclidean Steiner Trees in the Plane An Exact Algorithm"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199710)30:3<149::AID-NET1>3.3.CO;2-M"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/RNDM.2017.8093022"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.02.020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2014.6979953"},{"key":"ref20","first-page":"276","volume":"55","author":"orlowski","year":"2009","journal-title":"SNDlib 1 0-survivable Network Design Library"}],"event":{"name":"2019 15th International Conference on the Design of Reliable Communication Networks (DRCN)","start":{"date-parts":[[2019,3,19]]},"location":"Coimbra, Portugal","end":{"date-parts":[[2019,3,21]]}},"container-title":["2019 15th International Conference on the Design of Reliable Communication Networks (DRCN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8703491\/8713615\/08713664.pdf?arnumber=8713664","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:25:19Z","timestamp":1658247919000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8713664\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/drcn.2019.8713664","relation":{},"subject":[],"published":{"date-parts":[[2019,3]]}}}