{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T09:11:01Z","timestamp":1676797861620},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0020-0190(98)00047-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"127-132","source":"Crossref","is-referenced-by-count":11,"title":["Fast data transmission and maximal dynamic flow"],"prefix":"10.1016","volume":"66","author":[{"given":"Guoliang","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shangzhi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Ben Rosen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00047-7_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0020-0190(93)90057-G","article-title":"On the quickest path problem","volume":"46","author":"Chen","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0305-0548(94)90045-0","article-title":"Algorithms for the constrained quickest path problem and the enumeration of quickest paths","volume":"21","author":"Chen","year":"1994","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0305-0548(93)90096-2","article-title":"An algorithm for finding the k quickest paths in a network","volume":"20","author":"Chen","year":"1993","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(94)00008-5","article-title":"Finding the k quickest simple paths in a network","volume":"50","author":"Chen","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","article-title":"The quickest path problem","volume":"17","author":"Chen","year":"1990","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB6","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/S0020-0190(98)00047-7_BIB7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00047-7_BIB8","doi-asserted-by":"crossref","first-page":"823","DOI":"10.1016\/0167-8191(92)90048-C","article-title":"Distributed algorithms for the quickest path problem","volume":"18","author":"Hung","year":"1992","journal-title":"Parallel Comput."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB9","series-title":"WADS'95","first-page":"291","article-title":"On the computation of fast data transmissions in networks with capacities and delays","volume":"955","author":"Kagaris","year":"1995"},{"key":"10.1016\/S0020-0190(98)00047-7_BIB10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(93)90214-T","article-title":"The all-pairs quickest path problem","volume":"45","author":"Lee","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB11","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","article-title":"Algorithms for the quickest path problem and the enumeration of quickest paths","volume":"18","author":"Rosen","year":"1991","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0020-0190(98)00047-7_BIB12","series-title":"Proc. IEEE 1992 Internat. Conf. Comput. Inform.","first-page":"22","article-title":"Minimum time message transmission in networks","author":"Xue","year":"1992"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000477?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000477?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T18:54:00Z","timestamp":1555959240000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000477"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0020019098000477"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00047-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}