390 search results - page 1 / 78 » Computing shortest paths for any number of hops |
TON
2002
13 years 4 months ago
2002
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
MFCS
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We show how duality properties and geometric considerations are used in studies related to virtual path layouts of ATM networks. We concentrate on the one-to-many problem...
ESA
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
INFOCOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of p...
ALGORITHMICA
2011
12 years 12 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...