265 search results - page 12 / 53 » Algorithms for Terminal Steiner Trees |
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
JUCS
2008
13 years 7 months ago
2008
: Evolutionary algorithms are effective search tools for tackling difficult optimization problems. In this paper an algorithm based on living processes where cooperation is the mai...
INFOCOM
1996
IEEE
13 years 11 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...
IPL
2002
13 years 7 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
SGP
2007
13 years 9 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...