Approximate shortest path queries using Voronoi duals

Shinichi Honiden, Michael E. Houle, Christian Sommer, Martin Wolff

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simplification of the graph by selecting nodes independently at random with probability p. Edges are generated as the Voronoi dual of the original graph, using the selected nodes as Voronoi sites. This overlay graph allows for fast computation of approximate shortest paths for general, undirected graphs. The time-quality tradeoff decision can be made at query time. We provide bounds on the approximation ratio of the path lengths as well as experimental results. The theoretical worst-case approximation ratio is bounded by a logarithmic factor. Experiments show that our approximation method based on Voronoi duals has extremely fast preprocessing time and efficiently computes reasonably short paths.

本文言語English
ホスト出版物のタイトルTransactions on Computational Science IX - Special Issue on Voronoi Diagrams in Science and Engineering
ページ28-53
ページ数26
DOI
出版ステータスPublished - 2010 12 13
外部発表はい
イベントInternational Symposium on Voronoi Diagrams 2009 - Copenhagen, Denmark
継続期間: 2009 6 232009 6 26

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6290 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

OtherInternational Symposium on Voronoi Diagrams 2009
CountryDenmark
CityCopenhagen
Period09/6/2309/6/26

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Approximate shortest path queries using Voronoi duals」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル