{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:44:39Z","timestamp":1725795879008},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319080093"},{"type":"electronic","value":"9783319080109"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08010-9_30","type":"book-chapter","created":{"date-parts":[[2014,6,18]],"date-time":"2014-06-18T22:17:50Z","timestamp":1403129870000},"page":"272-276","source":"Crossref","is-referenced-by-count":1,"title":["Fast Approximation of Shortest Path on Dynamic Information Networks"],"prefix":"10.1007","author":[{"given":"Junting","family":"Jin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaowei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuiping","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Tsuchiya, P.F.: The landmark hierarchy: A new hierarchy for routing in very large networks. In: SIGCOMM 1988: Proceedings on Communications Architectures and Protocols, pp. 35\u201342 (1988)","DOI":"10.1145\/52325.52329"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Gubichev, A., Bedathur, S.J., Seufert, S., Weikum, G.: Fast and accurate estimation of shortest paths in large graphs. In: CIKM 2010: Proceeding of the 19th ACM Conference on Information and Knowledge Management, pp. 499\u2013508. ACM (2010)","DOI":"10.1145\/1871437.1871503"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Das Sarma, A., Gollapudi, S., Najork, M., Panigrahy, R.: A sketch-Based distance oracle for web-scale graphs. In: WSDM 2010: Proceedings of the 3rd ACM International Conference on Web Search and Data Mining, pp. 401\u2013410 (2010)","DOI":"10.1145\/1718487.1718537"},{"issue":"1","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. Journal of the ACM\u00a052(1), 1\u201324 (2005)","journal-title":"Journal of the ACM"},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nabbi, U.: Fully dynamic algorithms for maintaining shortest path trees. Algorithmica\u00a034(2), 251\u2013281 (2000)","journal-title":"Algorithmica"},{"issue":"6","key":"30_CR6","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1109\/90.974525","volume":"9","author":"P. Narvaez","year":"2001","unstructured":"Narvaez, P., Siu, K., Tzeng, H.: New dynamic SPT algorithm based on a ball and string model. ACM Transactions on Networking\u00a09(6), 706\u2013718 (2001)","journal-title":"ACM Transactions on Networking"},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TC.2008.198","volume":"58","author":"P.F. Edward","year":"2009","unstructured":"Edward, P.F.: Chan and Yaya Yang: Shortest path tree computation in dynamic graphs. IEEE Transactions on Computers\u00a058(4), 541\u2013557 (2009)","journal-title":"IEEE Transactions on Computers"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-642-22351-8_16","volume-title":"Scientific and Statistical Database Management","author":"M. Qiao","year":"2011","unstructured":"Qiao, M., Cheng, H., Yu, J.X.: Querying shortest path distance with bounded errors in large graphs. In: Bayard Cushing, J., French, J., Bowers, S. (eds.) SSDBM 2011. LNCS, vol.\u00a06809, pp. 255\u2013273. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08010-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:37:32Z","timestamp":1558924652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08010-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319080093","9783319080109"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08010-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}