Results 1 
5 of
5
A Catalog of Hanan Grid Problems
 Networks
, 2000
"... We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including  but not li ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including
Rectilinear Group Steiner Trees and Applications in VLSI Design
, 2000
"... Given a set of disjoint groups of points in the plane, the rectilinear group Steiner tree problem is the problem of finding a shortest interconnection (under the rectilinear metric) which includes at least one point from each group. This is an important generalization of the wellknown rectiline ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
algorithm for solving the rectilinear group Steiner tree problem (and related variants of the problem). The algorithm essentially constructs a subgraph of the corresponding Hanan grid on which existing algorithms for solving the Steiner tree problem in graphs are applied. The reductions of the Hanan
Preferred Direction Steiner Trees
"... Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are frequently abstracted as a single rectilinear plane, ignoring via costs, layer dependent routing costs, and congestion impact for routing in a particular direction. In this ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
, obtaining reductions in tree cost of 11% to 37% on average for random problems. Our results include a proof that the performance bound of Minimum Spanning Tree cost to Steiner Minimal Tree cost under this model is 2:1 (in contrast to 1.5:1 for planar problems). We adapt the Hanan grid to this model
Nontree Routing for Reliability and Yield Improvement
, 2002
"... We propose to introduce redundant interconnects for manufacturing yield and reliability improvement. By introducing redundant interconnects, the potential for open faults is reduced at the cost of increased potential for short faults; overall, manufacturing yield and fault tolerance can be improved. ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
issues as wirelength increase budget, routing obstacles, and use of Steiner points. ¯ We show that an optimum solution can always be found on the Hanan grid defined by the terminals and the corners of the feasible routing region. ¯ We give a compact integer program formulation which, for up to 100
The Steiner Tree Problem in Orientation Metrics
 J. Comp. Syst. Sci
, 1997
"... Given a set \Theta of ff i (i = 1; 2; : : : ; k) orientations (angles) in the plane, one can define a distance function which induces a metric in the plane, called the orientation metric [3]. In the special case where all the angles are equal, we call the metric a uniform orientation metric [2]. Spe ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
on the 3 metric. In the 2 metric, Hanan [1] shows that there exists a solution of the Steiner tree problem such that all Steiner points are on the intersections of grid lines formed by passing lines at directions i 2 ; i = 0; 1, through all demand points. But this is not true in the 3 metric