Approximate shortest path queries in graphs 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 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
ホスト出版物のタイトル6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009
ページ53-62
ページ数10
DOI
出版ステータスPublished - 2009 12 1
外部発表はい
イベント6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009 - Copenhagen, Denmark
継続期間: 2009 6 232009 6 26

出版物シリーズ

名前6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009

Other

Other6th International Symposium on Voronoi Diagrams in Science and Engineering, ISVD 2009
国/地域Denmark
CityCopenhagen
Period09/6/2309/6/26

ASJC Scopus subject areas

  • 情報システム
  • 生体医工学
  • 応用数学

フィンガープリント

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

引用スタイル