410 search results - page 13 / 82 » Upgrading Shortest Paths in Networks |
118
click to vote
INFOCOM
2006
IEEE
15 years 7 months ago
2006
IEEE
Abstract— In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approx...
104
click to vote
COCOON
2001
Springer
15 years 6 months ago
2001
Springer
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
135
click to vote
TON
2008
15 years 1 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
121
click to vote
COR
2004
15 years 1 months ago
2004
The robust deviation shortest path problem with interval data is studied in this paper. After the formulation of the problem in mathematical terms, an exact algorithm, based on a ...
203
click to vote
SIGMOD
2009
ACM
16 years 1 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...