982 search results - page 19 / 197 » Solving Steiner tree problems in graphs to optimality |
GLVLSI
2003
IEEE
15 years 3 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...
123
click to vote
RECOMB
2012
Springer
13 years 7 days ago
2012
Springer
Signaling networks are essential for cells to control processes such as growth and response to stimuli. Although many “omic” data sources are available to probe signaling pathw...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
ASPDAC
2007
ACM
15 years 1 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...
SSS
2009
Springer
15 years 4 months ago
2009
Springer
Graph searching games have been extensively studied in the past years. The graph searching problem involves a team of searchers who are attempting to capture a fugitive moving alon...