Approximate shortest path queries in graphs using Voronoi duals

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

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
JournalNII Technical Reports
Issue number7
Publication statusPublished - 2008 Aug 25
Externally publishedYes

Fingerprint

Sampling

Keywords

  • Approximation
  • Graph algorithms
  • Shortest path
  • Voronoi

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications

Cite this

Approximate shortest path queries in graphs using Voronoi duals. / Sommer, Christian; Houle, Michael E.; Wolff, Martin; Honiden, Shinichi.

In: NII Technical Reports, No. 7, 25.08.2008.

Research output: Contribution to journalArticle

Sommer, Christian ; Houle, Michael E. ; Wolff, Martin ; Honiden, Shinichi. / Approximate shortest path queries in graphs using Voronoi duals. In: NII Technical Reports. 2008 ; No. 7.
@article{77789376dedb4170950838ca67070d3d,
title = "Approximate shortest path queries in graphs using Voronoi duals",
abstract = "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.",
keywords = "Approximation, Graph algorithms, Shortest path, Voronoi",
author = "Christian Sommer and Houle, {Michael E.} and Martin Wolff and Shinichi Honiden",
year = "2008",
month = "8",
day = "25",
language = "English",
journal = "NII Technical Reports",
issn = "1346-5597",
publisher = "National Institute of Informatics",
number = "7",

}

TY - JOUR

T1 - Approximate shortest path queries in graphs using Voronoi duals

AU - Sommer, Christian

AU - Houle, Michael E.

AU - Wolff, Martin

AU - Honiden, Shinichi

PY - 2008/8/25

Y1 - 2008/8/25

N2 - 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.

AB - 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.

KW - Approximation

KW - Graph algorithms

KW - Shortest path

KW - Voronoi

UR - http://www.scopus.com/inward/record.url?scp=49749085177&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49749085177&partnerID=8YFLogxK

M3 - Article

JO - NII Technical Reports

JF - NII Technical Reports

SN - 1346-5597

IS - 7

ER -