422 search results - page 5 / 85 » Shortest paths between shortest paths and independent sets |
STACS
2010
Springer
14 years 17 days ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v ∈ V is said to be t-approximate shortest path if its length is at most t ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
COMPGEOM
2000
ACM
13 years 11 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Directions search returns the shortest path from a source to a destination on a road network. However, the search interests of users may be exposed to the service providers, thus r...
IWCMC
2009
ACM
14 years 2 months ago
2009
ACM
This paper addresses the additional energy consumption in wireless sensor networks where the communication between the sensor nodes and the sink nodes does not always make use of ...