NDLI: Approximate Shortest Path Queries in Graphs Using Voronoi Duals

Content Provider	IEEE Xplore Digital Library
Author	Honiden, S. Houle, M.E. Sommer, C. Wolff, M.
Copyright Year	2009
Abstract	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.
Starting Page	53
Ending Page	62
File Size	1187613
Page Count	10
File Format	PDF
ISBN	9781424447695
DOI	10.1109/ISVD.2009.30
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-06-23
Publisher Place	Denmark
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Roads Approximation methods Sampling methods Social network services Proteins Application software Informatics Transportation Shortest path problem Data structures graph Voronoi diagram shortest path approximation distance oracle
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Approximate shortest path queries in graphs using voronoi duals.

Approximate shortest path queries using voronoi duals (2009).

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph

Voronoi Diagram for services neighboring a highway (2003)

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Shortest path queries in planar graphs

Efficient single-source shortest path and distance queries on large graphs

Distance oracles for vertex-labeled graphs.

Shortest Paths and Voronoi diagrams with Transportation Networks under General Distances (2005)

Approximate Shortest Path Queries in Graphs Using Voronoi Duals

Similar Documents

Approximate shortest path queries in graphs using voronoi duals.

Approximate shortest path queries using voronoi duals (2009).

Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph

Voronoi Diagram for services neighboring a highway (2003)

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Shortest path queries in planar graphs

Efficient single-source shortest path and distance queries on large graphs

Distance oracles for vertex-labeled graphs.

Shortest Paths and Voronoi diagrams with Transportation Networks under General Distances (2005)

Approximate Shortest Path Queries in Graphs Using Voronoi Duals