2024-03-28T07:54:53Z
https://repository.nii.ac.jp/oai
oai:repository.nii.ac.jp:00001245
2023-01-05T06:25:08Z
136
NII Technical Report (NII-2008-007E):Approximate Shortest Path Queries in Graphs Using Voronoi Duals
Sommer, Christian
Houle, Michael E.
Wolff, Martin
本位田, 真一
Honiden, Shinichi
テクニカルレポート
Technical Report
We propose an approximation method to answer shortest path queries in graphs, based on hierarchical random sampling and Voronoi duals. The lowest level of the hierarchy stores the initial graph. At each higher level, we compute a simplification of the graph on the level below, by selecting a constant fraction of nodes. Edges are generated as the Voronoi dual within the lower level, using the selected nodes as Voronoi sites. This hierarchy allows for fast computation of approximate shortest paths for general graphs. The time-quality tradeoff decision can be made at query time. We provide bounds on the approximation ratio of the path lengths.
国立情報学研究所
2008-08-18
eng
departmental bulletin paper
https://doi.org/10.20736/0000001245
https://repository.nii.ac.jp/records/1245
10.20736/0000001245
1346-5597
NIIテクニカル・レポート
NII Technical Report
none
https://repository.nii.ac.jp/record/1245/files/08-007E.pdf
application/pdf
306.0 kB
2019-03-12