{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:12:45Z","timestamp":1760440365483},"reference-count":11,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5967,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1002\/(sici)1097-0037(199905)33:3<167::aid-net2>3.0.co;2-j","type":"journal-article","created":{"date-parts":[[2004,11,14]],"date-time":"2004-11-14T19:38:44Z","timestamp":1100461124000},"page":"167-174","source":"Crossref","is-referenced-by-count":9,"title":["Transmissions in a network with capacities and delays"],"prefix":"10.1002","volume":"33","author":[{"given":"Dimitrios","family":"Kagaris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grammati E.","family":"Pantziou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Spyros","family":"Tragoudas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"Bondy","year":"1976","unstructured":"and Graph Theory with Applications, North-Holland, New York, 1976."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB2","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"Chen","year":"1990","journal-title":"Comput Oper Res"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB3","series-title":"LNCS","first-page":"193","volume-title":"On-line and dynamic algorithms for shortest path problems","volume":"900","author":"Djidjev","year":"1995","unstructured":"and On-line and dynamic algorithms for shortest path problems. [Proc. 12th Symp. on Theoretical Aspects of Computer Science (STACS'95)], LNCS 900, Springer-Verlag, 1995, pp. 193-204."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB4","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"Frederickson","year":"1991","journal-title":"J ACM"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1006\/jagm.1995.1027","volume":"19","author":"Frederickson","year":"1995","journal-title":"J Alg"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB6","series-title":"LNCS","first-page":"28","volume-title":"Searching among intervals and compact routing tables","volume":"700","author":"Frederickson","year":"1993","unstructured":"Searching among intervals and compact routing tables [Proc. 20th International Coll. on Automata, Languages and Progr. (ICALP'93)], LNCS 700, Springer-Verlag, 1993, pp. 28-39."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"Fredman","year":"1987","journal-title":"J ACM"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB8","volume-title":"Computers and intractability. A guide to the theory of NP-completeness","author":"Garey","year":"1979","unstructured":"and Computers and intractability. A guide to the theory of NP-completeness, W. H. Freeman, New York, 1979."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB9","series-title":"LNCS","first-page":"44","volume-title":"On the quickest path problem","volume":"497","author":"Hung","year":"1991","unstructured":"and On the quickest path problem (Proc. ICCI'91), LNCS 497, Springer-Verlag, 1991, pp. 44-46."},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB10","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/0196-6774(85)90010-0","volume":"6","author":"Itai","year":"1985","journal-title":"J Alg"},{"key":"10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J-BIB11","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"Rosen","year":"1991","journal-title":"Comput Oper Res"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F(SICI)1097-0037(199905)33:3%3C167::AID-NET2%3E3.0.CO;2-J","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/(SICI)1097-0037(199905)33:3%3C167::AID-NET2%3E3.0.CO;2-J","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T10:07:36Z","timestamp":1625134056000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/(SICI)1097-0037(199905)33:3<167::AID-NET2>3.0.CO;2-J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,5]]}},"URL":"https:\/\/doi.org\/10.1002\/(sici)1097-0037(199905)33:3<167::aid-net2>3.0.co;2-j","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}