43 search results - page 3 / 9 » Querying approximate shortest paths in anisotropic regions |
COMPGEOM
1998
ACM
14 years 3 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
ISAAC
2004
Springer
14 years 4 months ago
2004
Springer
Let G be a graph containing N disjoint t-spanners that are inter-connected with M edges. We present an algorithm that constructs a data structure of size O(M2 + n log n) that answ...
SODA
2003
ACM
14 years 7 days ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
ICDE
2012
IEEE
12 years 1 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
JAL
2007
13 years 10 months ago
2007
Abstract. We consider the problem of estimating the length of a shortest path in a DAG whose edge lengths are known only approximately but can be determined exactly at a cost. Init...