801 search results - page 21 / 161 » Minimal Locked Trees |
CCCG
2007
14 years 11 months ago
2007
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
VLSID
2002
IEEE
15 years 10 months ago
2002
IEEE
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
GD
2003
Springer
15 years 2 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
OPODIS
2004
14 years 11 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
ASPDAC
2005
ACM
14 years 11 months ago
2005
ACM
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...