{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T22:48:50Z","timestamp":1753051730138,"version":"3.37.3"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2018,8,1]],"date-time":"2018-08-01T00:00:00Z","timestamp":1533081600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"crossref","award":["W911NF-09-2-0053"],"award-info":[{"award-number":["W911NF-09-2-0053"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,8,1]]},"DOI":"10.1109\/tkde.2018.2792470","type":"journal-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T19:44:15Z","timestamp":1515786255000},"page":"1533-1546","source":"Crossref","is-referenced-by-count":3,"title":["Making a Small World Smaller: Path Optimization in Networks"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0996-2807","authenticated-orcid":false,"given":"Sourav","family":"Medya","sequence":"first","affiliation":[]},{"given":"Petko","family":"Bogdanov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1997-7140","authenticated-orcid":false,"given":"Ambuj","family":"Singh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556224"},{"key":"ref33","first-page":"3922","article-title":"Optimizing resilience\n in large scale networks.","author":"wu","year":"2016","journal-title":"Proc 30th AAAI Conf Artif Intell"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492621"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113347"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011794"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2013.319"},{"key":"ref36","first-page":"420","article-title":"Minimizing the diameter of a network using shortcut edges","author":"demaine","year":"2010","journal-title":"Proc 12th Scand Conf Algorithm Theory"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.4"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063952"},{"key":"ref10","first-page":"272","article-title":"Minimizing avergae shortest path distances via shortcut edge addition","author":"meyerson","year":"2009","journal-title":"Proc 12th Int Workshop 13th Int Workshop Approx Randomization Comb Optim Algorithms Tech"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260105"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009798010579"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526806"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.jairtraman.2008.04.010"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.158"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref17","first-page":"259","article-title":"Tractable models for information diffusion in social networks","author":"kimura","year":"2006","journal-title":"Proc PKDD"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/1116025"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/0471660302"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989368"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-014-0219-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974010.64"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623626"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623704"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396795"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187908"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0966-6923(94)90032-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21311-3_9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2010.06.001"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0140"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_4"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10522"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.3.3.177"},{"key":"ref26","first-page":"690","article-title":"Vc-dimension and shortest path algorithms","author":"abraham","year":"2011","journal-title":"Proc Int Colloq Automata Lang Program"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.57"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8405649\/08255632.pdf?arnumber=8255632","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T14:02:39Z","timestamp":1643205759000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8255632\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,1]]},"references-count":38,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2018.2792470","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2018,8,1]]}}}