{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:45Z","timestamp":1725664545812},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:52:58Z","timestamp":1330278778000},"page":"291-302","source":"Crossref","is-referenced-by-count":5,"title":["On the computation of fast data transmissions in networks with capacities and delays"],"prefix":"10.1007","author":[{"given":"Dimitrios","family":"Kagaris","sequence":"first","affiliation":[]},{"given":"Grammati E.","family":"Pantziou","sequence":"additional","affiliation":[]},{"given":"Spyros","family":"Tragoudas","sequence":"additional","affiliation":[]},{"given":"Christos D.","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"Y. L. Chen","year":"1990","unstructured":"Y. L. Chen and Y. H. Chin, \u201cThe quickest path problem\u201d, Computers and Operations Research, 17, pp. 153\u2013161, 1990.","journal-title":"Computers and Operations Research"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"H. N. Djidjev, G. E. Pantziou and C. D. Zaroliagis, \u201cOn-line and Dynamic Algorithms for Shortest Path Problems,\u201d Proc. 12th Symp. on Theor. Aspects of Computer Science (STACS'95), LNCS 900, pp.193\u2013204, Springer-Verlag, 1995.","DOI":"10.1007\/3-540-59042-0_73"},{"issue":"1","key":"26_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1145\/102782.102788","volume":"38","author":"G. N. Frederickson","year":"1991","unstructured":"G. N. Frederickson, \u201cPlanar Graph Decomposition and All Pairs Shortest Paths,\u201d J. ACM, Vol.38, No. 1, pp.162\u2013204, 1991.","journal-title":"J. ACM"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"G. N. Frederickson, \u201cUsing Cellular Graph Embeddings in Solving All Pairs Shortest Path Problems\u201d, Proc. 30th Annual IEEE Symp. on FOCS, 1989, pp.448\u2013453.","DOI":"10.1109\/SFCS.1989.63517"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"G.N. Frederickson, \u201cSearching among Intervals and Compact Routing Tables\u201d, Proc. 20th ICALP, 1993, LNCS 700, pp.28\u201339, Springer-Verlag.","DOI":"10.1007\/3-540-56939-1_59"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan, \u201cFibonacci heaps and their uses in improved network optimization algorithms,\u201d J. ACM, Vol. 34, pp. 596\u2013615, 1987.","journal-title":"J. ACM"},{"key":"26_CR7","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey, and D.S. Johnson, \u201cComputers and Intractability. A Guide to the Theory of NP-Completeness\u201d, W.H. Freeman and Company, New York, NY, 1979."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Y.-C. Hung and G.-H. Chen, \u201cOn the quickest path problem,\u201d Proc. ICCI'91, LNCS 497, Springer-Verlag, pp. 44\u201346, 1991.","DOI":"10.1007\/3-540-54029-6_152"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1016\/0196-6774(85)90010-0","volume":"6","author":"A. Itai","year":"1985","unstructured":"A. Itai, and M. Rodeh, \u201cScheduling Transmissions in a Network\u201d, Journal of Algorithms, 6, pp. 409\u2013429, 1985.","journal-title":"Journal of Algorithms"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/0305-0548(91)90063-W","volume":"18","author":"J.B. Rosen","year":"1991","unstructured":"J.B. Rosen, S.Z. Sun and G.L. Xue, \u201cAlgorithms for the quickest path problem and the enumeration of quickest paths,\u201d Comp. and O.R., 18, pp.579\u2013584, 1991.","journal-title":"Comp. and O.R."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:33:48Z","timestamp":1619573628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}