{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T04:47:05Z","timestamp":1729658825300,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/infcom.2002.1019273","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T18:04:13Z","timestamp":1056564253000},"page":"312-321","source":"Crossref","is-referenced-by-count":2,"title":["The travelling miser problem"],"prefix":"10.1109","volume":"1","author":[{"given":"D.","family":"Breitgand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Raz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Shavitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/35.833567"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/OPNARC.1999.758557"},{"key":"13","article-title":"Shortest paths without a map","author":"papadimitriou","year":"1989","journal-title":"17th ICALP"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.1999.5340509"},{"key":"11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.0.CO;2-A","article-title":"A dynamic programming algorithm for the shortest path problem with time windows and linear node costs","volume":"31","author":"loachim","year":"1998","journal-title":"Networks"},{"key":"12","first-page":"261","article-title":"The canadian traveller problem","author":"bar-noy","year":"0","journal-title":"Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) San-Francisco California 1991"},{"key":"3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"1958","journal-title":"Quart Appl Math"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230210304"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/35.825651"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00035-1"},{"key":"7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s004460050023","article-title":"Distributed shortest path and minimum-delay protocols in networks with time-dependent edge-length","volume":"10","author":"orda","year":"1996","journal-title":"Distributed Computing"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01919767"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(66)90009-6"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1080\/02331937208842096"},{"journal-title":"Dynamic Programming","year":"1957","author":"bellman","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/79147.214078"}],"event":{"name":"IEEE Information Communications Conference (INFOCOM 2002)","acronym":"INFCOM-02","location":"New York, NY, USA"},"container-title":["Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7943\/21921\/01019273.pdf?arnumber=1019273","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,24]],"date-time":"2018-02-24T18:23:30Z","timestamp":1519496610000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1019273\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/infcom.2002.1019273","relation":{},"subject":[]}}