265 search results - page 4 / 53 » Algorithms for Terminal Steiner Trees |
ASPDAC
2007
ACM
13 years 10 months ago
2007
ACM
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
DAC
2001
ACM
14 years 7 months ago
2001
ACM
This paper presents the concept of flexibility ? a geometric property associated with Steiner trees. Flexibility is related to the routability of the Steiner tree. We present an o...
COR
2007
13 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
SODA
1990
ACM
13 years 7 months ago
1990
ACM
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
EVOW
2007
Springer
14 years 13 days ago
2007
Springer
The Steiner Tree Problem (STP) in graphs is a well-known