1671 search results - page 52 / 335 » On the Covering Steiner Problem |
SGP
2007
14 years 1 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
INFOCOM
1996
IEEE
14 years 3 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
ICCAD
1995
IEEE
14 years 2 months ago
1995
IEEE
: We study the minimum-cost bounded-skew routing tree problem under the Elmore delay model. We presenttwo approachesto construct bounded-skew routing trees: (i) the Boundary Mergin...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
ESA
2009
Springer
14 years 5 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...