177 search results - page 17 / 36 » Link Distance and Shortest Path Problems in the Plane |
NOMS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
ICC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
IJRR
2008
13 years 8 months ago
2008
In this paper we discuss the problem of planning safe paths amidst unpredictably moving obstacles in the plane. Given the initial positions and the maximum speeds of the moving ob...
ALGORITHMICA
2011
13 years 3 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...