474 search results - page 38 / 95 » On Multicast Path Finding Algorithms |
STOC
1992
ACM
13 years 11 months ago
1992
ACM
Given an expander graph G = (V, E) and a set of q disjoint pairs of vertices in V , we are interested in finding for each pair (ai, bi), a path connecting ai to bi, such that the ...
TON
2002
13 years 7 months ago
2002
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristic...
COMGEO
2000
ACM
13 years 7 months ago
2000
ACM
Given a set X of points in the plane, two distinguished points s,t X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t...
SIGCOMM
2006
ACM
14 years 1 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
MOBIHOC
2009
ACM
14 years 8 months ago
2009
ACM
In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according ...