{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:36:36Z","timestamp":1755794196827,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/milcom.2017.8170722","type":"proceedings-article","created":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T22:40:39Z","timestamp":1513032039000},"page":"587-591","source":"Crossref","is-referenced-by-count":4,"title":["Shortest paths for routing information over temporally dynamic communication networks"],"prefix":"10.1109","author":[{"given":"Michael J.","family":"Hirsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azar","family":"Sadeghnejad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector","family":"Ortiz-Pena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/2618243.2618282"},{"year":"0","journal-title":"LINDO","key":"ref11"},{"year":"0","journal-title":"Matlab","key":"ref12"},{"year":"2011","author":"tang","journal-title":"Temporal network metrics and their application to real world networks","key":"ref13"},{"year":"2015","journal-title":"Technical Report","article-title":"U.S. Air Force. USAF Strategic Master Plan","key":"ref14"},{"key":"ref15","article-title":"Federal Aviation Administration U.S. Department of Transportation","volume":"2","year":"2012","journal-title":"Aviation Maintenance Technician Handbook-Airframe"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1002\/net.21672"},{"year":"1998","author":"wolsey","journal-title":"Integer Programming","key":"ref17"},{"year":"0","journal-title":"ILOG CPLEX","key":"ref4"},{"year":"2007","author":"bosse","journal-title":"Concepts Models and Tools for Information Fusion","key":"ref3"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/5.554205"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref5"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1007\/s10878-014-9732-2"},{"key":"ref7","article-title":"Optimal information routing across dynamic temporal communication networks","author":"hirsch","year":"2017","journal-title":"Submitted to IEEE Networks"},{"year":"1999","author":"ausiello","journal-title":"Complexity and Approximation Combinatorial Optimization Problems and Their Approximability Properties","key":"ref2"},{"year":"2017","journal-title":"Technical Report","article-title":"Multi-Vehicle Collaboration with Minimal Communication and Minimal Energy","key":"ref1"},{"key":"ref9","article-title":"UAV command, control, and communication","volume":"24","author":"howard","year":"2013","journal-title":"Military and Aerospace Electronics"}],"event":{"name":"2017 IEEE Military Communications Conference (MILCOM)","start":{"date-parts":[[2017,10,23]]},"location":"Baltimore, MD","end":{"date-parts":[[2017,10,25]]}},"container-title":["MILCOM 2017 - 2017 IEEE Military Communications Conference (MILCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8125230\/8170714\/08170722.pdf?arnumber=8170722","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T22:52:00Z","timestamp":1516056720000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8170722\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/milcom.2017.8170722","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}