Results 1  10
of
970,404
Faster Algorithms for AllPairs Small Stretch Distances in Weighted Graphs
"... Abstract. Let G = (V,E) be a weighted undirected graph, with nonnegative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are kno ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that allpairs stretch 3 distances can be computed in Õ(n 2) time and allpairs stretch 7/3 distances can
FASTER ALGORITHMS FOR ALLPAIRS APPROXIMATE SHORTEST PATHS IN UNDIRECTED GRAPHS
, 2006
"... Let G = (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate ˆ δ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t iff δ(u, v) ≤ ˆ δ(u, v) ≤ t · δ(u, v). Computing allpairs small stretch distances efficiently (both in terms of time ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Let G = (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate ˆ δ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t iff δ(u, v) ≤ ˆ δ(u, v) ≤ t · δ(u, v). Computing allpairs small stretch distances efficiently (both in terms of time
AllPairs SmallStretch Paths
 Journal of Algorithms
, 1997
"... Let G = (V; E) be a weighted undirected graph. A path between u; v 2 V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding smallstretch paths between all pairs of vertices in the graph G. It is easy to see that f ..."
Abstract

Cited by 39 (7 self)
 Add to MetaCart
Let G = (V; E) be a weighted undirected graph. A path between u; v 2 V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding smallstretch paths between all pairs of vertices in the graph G. It is easy to see
AllPairs SmallStretch Paths
"... Abstract Let G = (V; E) be a weighted undirected graph. A path between u; v 2 V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding smallstretch paths between all pairs of vertices in the graph G. It is easy to se ..."
Abstract
 Add to MetaCart
Abstract Let G = (V; E) be a weighted undirected graph. A path between u; v 2 V is said to be of stretch t if its length is at most t times the distance between u and v in the graph. We consider the problem of finding smallstretch paths between all pairs of vertices in the graph G. It is easy
Faster Algorithms for Approximate Distance Oracles and AllPairs Small StretchPaths
"... ffi(u, v) < = ^ffi(u, v) < = t * ffi(u, v). The most efficient algorithms known for computing small stretch distances in Gare the approximate distance oracles of [16] and the three algorithms in [9] to compute allpairs stretch t distancesfor t = 2, 7/3, and 3. We present faster algorithms fo ..."
Abstract
 Add to MetaCart
ffi(u, v) < = ^ffi(u, v) < = t * ffi(u, v). The most efficient algorithms known for computing small stretch distances in Gare the approximate distance oracles of [16] and the three algorithms in [9] to compute allpairs stretch t distancesfor t = 2, 7/3, and 3. We present faster algorithms
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 633 (5 self)
 Add to MetaCart
In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which
Distance Metric Learning, With Application To Clustering With SideInformation
 ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 15
, 2003
"... Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many "plausible" ways, and if a clustering algorithm such as Kmeans initially fails to find one that is meaningful to a user, the only recourse may be for the us ..."
Abstract

Cited by 799 (14 self)
 Add to MetaCart
examples. In this paper, we present an algorithm that, given examples of similar (and, if desired, dissimilar) pairs of points in R , learns a distance metric over R that respects these relationships. Our method is based on posing metric learning as a convex optimization problem, which allows us
Adhoc OnDemand Distance Vector Routing
 IN PROCEEDINGS OF THE 2ND IEEE WORKSHOP ON MOBILE COMPUTING SYSTEMS AND APPLICATIONS
, 1997
"... An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such adhoc n ..."
Abstract

Cited by 3167 (15 self)
 Add to MetaCart
An adhoc network is the cooperative engagement of a collection of mobile nodes without the required intervention of any centralized access point or existing infrastructure. In this paper we present Adhoc On Demand Distance Vector Routing (AODV), a novel algorithm for the operation of such ad
Distance Vector Multicast Routing Protocol
 RFC 1075, BBN
, 1988
"... This RFC describes a distancevectorstyle routing protocol for routing multicast datagrams through an internet. It is derived from the Routing Information Protocol (RIP) [1], and implements multicasting as described in RFC1054. This is an experimental protocol, and its implementation is not recomm ..."
Abstract

Cited by 477 (3 self)
 Add to MetaCart
This RFC describes a distancevectorstyle routing protocol for routing multicast datagrams through an internet. It is derived from the Routing Information Protocol (RIP) [1], and implements multicasting as described in RFC1054. This is an experimental protocol, and its implementation
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract

Cited by 522 (8 self)
 Add to MetaCart
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance
Results 1  10
of
970,404