422 search results - page 20 / 85 » Shortest paths between shortest paths and independent sets |
108
click to vote
ICNP
1997
IEEE
15 years 5 months ago
1997
IEEE
Future computer networks are expected to carry bursty traffic. Shortest -path routing protocols such as OSPF and RIP have t he disadvantage of causing bottlenecks due to their inh...
121
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...
125
click to vote
SIAMCOMP
2000
15 years 1 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
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...
148
click to vote
ICDE
2012
IEEE
13 years 3 months ago
2012
IEEE
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...