{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:35:19Z","timestamp":1725521719136},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540897361"},{"type":"electronic","value":"9783540897378"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-89737-8_17","type":"book-chapter","created":{"date-parts":[[2008,12,11]],"date-time":"2008-12-11T09:13:24Z","timestamp":1228986804000},"page":"166-171","source":"Crossref","is-referenced-by-count":0,"title":["A Web Based Pathfinder Service for Road Networks in India"],"prefix":"10.1007","author":[{"given":"Siddharth","family":"Jain","sequence":"first","affiliation":[]},{"given":"R. K.","family":"Ghosh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Car, A., Frank, A.U.: Modelling a hierarchy of space applied to large road networks. In: IGIS Workshop (1994)","DOI":"10.1007\/3-540-58795-0_30"},{"key":"17_CR2","unstructured":"Dai, L., Maheshwari, A.: Fast shortest path algorithms for road networks (2005)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik, 269\u2013271 (1959)","DOI":"10.1007\/BF01386390"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Hart, P.E., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybermetrics, 100\u2013107 (1968)","DOI":"10.1109\/TSSC.1968.300136"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Jagadeesh, G.R., Srikanthan, T., Quek, K.H.: Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Transactions on Intelligent Transportation Systems 3 (December 2002)","DOI":"10.1109\/TITS.2002.806806"},{"key":"17_CR6","unstructured":"Jain, S.: Location-aware navigation using mobile devices and the internet. Master\u2019s thesis, IIT Kanpur (May 2008)"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering 14 (September\/October 2002)","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"17_CR8","unstructured":"Lim, Y., Kim, H.: Shortest path algorithm for real road network based on path overlap. Journal of Eastern Asia Society for Transportation Studies (2005)"},{"key":"17_CR9","unstructured":"Park, C., Sung, K., Doh, S., Park, S.: Finding a path in hierarchical road networks. In: IEEE Intelligent Transportation Systems Conference Proceedings (August 2001)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89737-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T04:48:46Z","timestamp":1557982126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89737-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540897361","9783540897378"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89737-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}