{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:04:48Z","timestamp":1761487488607},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022446","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:03:27Z","timestamp":1131861807000},"page":"181-192","source":"Crossref","is-referenced-by-count":3,"title":["The quickest path problem in distributed computing systems"],"prefix":"10.1007","author":[{"given":"Yung-Chen","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, \u201cOptimal distributed algorithm for minimum weight spanning tree, counting, leader election and related problems,\u201d Proceedings of 19th Annual ACM Symposium on Theory of Computing, May 1987, pp. 230\u2013240.","DOI":"10.1145\/28395.28421"},{"issue":"no.3","key":"13_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1109\/TIT.1987.1057314","volume":"33","author":"B. Awerbuch","year":"1987","unstructured":"B. Awerbuch and R. Gallager, \u201cA new distributed algorithm to find breadth first search trees,\u201d IEEE Transactions on Information Theory, vol. 33, no. 3, pp. 315\u2013322, May 1987.","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR3","first-page":"63","volume":"10","author":"L. D. Bodin","year":"1982","unstructured":"L. D. Bodin, B. L. Golden, A. A. Assad, and M. O. Ball, \u201cRouting and scheduling of vehicles and crews: the state of the art,\u201d Computers and Operations Research, vol. 10, pp. 63\u2013211, 1982.","journal-title":"Computers and Operations Research"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0305-0548(90)90039-A","volume":"17","author":"Y. L. Chen","year":"1989","unstructured":"Y. L. Chen and Y. H. Chin, \u201cThe quickest path problem,\u201d Computers and Operations Research, vol. 17, pp. 153\u2013161, 1989.","journal-title":"Computers and Operations Research"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0890-5401(90)90051-I","volume":"86","author":"G. N. Frederickson","year":"1990","unstructured":"G. N. Frederickson, \u201cA distributed shortest path algorithm for a planar network,\u201d Information and Computation, vol. 86, pp. 140\u2013159, 1990.","journal-title":"Information and Computation"},{"key":"13_CR6","doi-asserted-by":"crossref","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 Journal of the ACM, vol. 34, pp. 596\u2013615, 1987.","journal-title":"Journal of the ACM"},{"key":"13_CR7","volume-title":"Fundamentals of Data Structures","author":"E. Horowitz","year":"1976","unstructured":"E. Horowitz and S. Sahni, Fundamentals of Data Structures, Potomac MD: Computer Science Press, 1976."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Y. C. Hung and G. H. Chen, \u201cOn the quickest path problem,\u201d Proceedings of the International Conference on Computing and Information, Ottawa, Canada, May 1991, to appear.","DOI":"10.1007\/3-540-54029-6_152"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"K. B. Lakshmanan, K. Thulasiraman, and M. A. Comeau, \u201cAn efficient distributed protocol for finding shortest paths in networks with negative weights\u201d IEEE Transactions on Software engineering, vol. 15, no. 5, May 1989.","DOI":"10.1109\/32.24713"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022446.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:48:29Z","timestamp":1607550509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552367"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0022446","relation":{},"subject":[]}}