390 search results - page 4 / 78 » Computing shortest paths for any number of hops |
118
click to vote
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
We design a self-stabilizing cluster routing algorithm based on the link-cluster architecture of wireless ad hoc networks. The network is divided into clusters. Each cluster has a...
STACS
2010
Springer
15 years 4 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 ...
117
click to vote
ICNP
2005
IEEE
15 years 5 months ago
2005
IEEE
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
112
Voted
IPL
2008
14 years 11 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
121
click to vote
COMGEO
2006
ACM
14 years 11 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...