274 search results - page 25 / 55 » The Polymatroid Steiner Problems |
162
click to vote
ASPDAC
2007
ACM
15 years 9 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...
149
Voted
IPCO
2001
15 years 7 months ago
2001
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [16] discovered primal-dual approxima...
148
Voted
GLVLSI
2003
IEEE
15 years 11 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
170
click to vote
TCAD
2008
15 years 5 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
137
click to vote
COCOA
2007
Springer
15 years 11 months ago
2007
Springer
We consider the problem of connecting given vertex pairs over a stochastic metric graph, each vertex of which has a probability of presence independently of all other ver