Publication Date:
2007-04-28
Description:
When you drive to somewhere far away, you will leave your current location via one of only a few important traffic junctions. Starting from this informal observation, we developed an algorithmic approach, transit node routing, that allows us to reduce quickest path queries in road networks to a small number of table lookups. For road maps of Western Europe and the United States, our best query times improved over the best previously published figures by two orders of magnitude. This is also more than one million times faster than the best known algorithm for general networks.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Bast, Holger -- Funke, Stefan -- Sanders, Peter -- Schultes, Dominik -- New York, N.Y. -- Science. 2007 Apr 27;316(5824):566.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉Max-Planck-Institut fur Informatik, 66123 Saarbrucken, Germany.〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/17463281" target="_blank"〉PubMed〈/a〉
Print ISSN:
0036-8075
Electronic ISSN:
1095-9203
Topics:
Biology
,
Chemistry and Pharmacology
,
Computer Science
,
Medicine
,
Natural Sciences in General
,
Physics
Permalink
