{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:11:51Z","timestamp":1740100311595,"version":"3.37.3"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["T1EDK-00108"],"award-info":[{"award-number":["T1EDK-00108"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,9,24]]},"DOI":"10.1109\/seeda-cecnsm53056.2021.9566273","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:30:59Z","timestamp":1634689859000},"page":"1-5","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting shortest path algorithms for navigation systems"],"prefix":"10.1109","author":[{"given":"Vaios","family":"Patras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Fudos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kyriakos","family":"Koritsoglou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Tsoumanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"ref11","first-page":"299","article-title":"A new algorithm to compute alternate paths in reliable OSPF (ROSPF)","author":"pu","year":"2001","journal-title":"Proceedings International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA 2001"},{"key":"ref12","first-page":"108","article-title":"Improved alternative route planning","volume":"33","author":"paraskevopoulos","year":"2013","journal-title":"ATMOS-13th Workshop on Algorithmic Approaches for Transportation Modelling Optimization and Systems-2013"},{"journal-title":"Accessibility of Housing","year":"0","author":"habitat","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00214-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19754-3_5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.apgeog.2018.02.013"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2006.889437"},{"key":"ref8","first-page":"1426","article-title":"A shortest path algorithm for real road network based on path overlap","volume":"6","author":"lim","year":"2005","journal-title":"Journal of the Eastern Asia Society for Transportation Studies"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref9","first-page":"414","article-title":"Exact and approximate algorithms for finding k-shortest paths with limited overlap","author":"chondrogiannis","year":"2017","journal-title":"20th International Conference on Extending Database Technology EDBT 2017"}],"event":{"name":"2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)","start":{"date-parts":[[2021,9,24]]},"location":"Preveza, Greece","end":{"date-parts":[[2021,9,26]]}},"container-title":["2021 6th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9565881\/9565882\/09566273.pdf?arnumber=9566273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:47:32Z","timestamp":1652197652000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9566273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,24]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/seeda-cecnsm53056.2021.9566273","relation":{},"subject":[],"published":{"date-parts":[[2021,9,24]]}}}