On a multinet wiring problem

Yang, Y.; Wing, O.

doi:10.1109/tct.1973.1083680

Cited by 12 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some fairly recent books and theses include -in chronological order -Lengauer [249], Kahng and Robins [229], Pecht and Wong [301], Sarrafzadeh and Wong [339], Gerez [173], Sait and Youssef [331], Sherwani [347], Vygen [378], Saxena et al [340] and Kahng et al [226]. Some early contributions on the routing problem are Yang and Wing [423] and Hightower [196]; more recent surveys can be found in Möhring et al [284], Cong et al [118], Peyer [303], Moffitt et al [283], Moffitt [282], Müller [286], Robins and Zelikovsky [325], Alpert et al [10] and Gester et al [175]. The list of combinatorial problems in chip design recently compiled by Korte and Vygen [238] illustrates the challenges in the field.…”

Section: Main Steps Of Physical Design: Placement and Routingmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Interconnection Trees in the Plane

Brazil

Zachariasen

2015

Algorithms and Combinatorics

View full text Add to dashboard Cite

Section: Main Steps Of Physical Design: Placement and Routingmentioning

confidence: 99%

“…The use of integer programming formulations for the problem dates back to Yang and Wing [423], who formulated a Steiner tree packing problem using an integer programming model. Aneja [15] and Wong [409] pioneered the use of integer programming for the Steiner tree problem in graphs in the early 1980s.…”

Section: Integer Programmingmentioning

confidence: 99%

Optimal Interconnection Trees in the Plane

Brazil

Zachariasen

2015

Algorithms and Combinatorics

View full text Add to dashboard Cite

Steiner tree problems

1992

View full text Add to dashboard Cite

show abstract

The Steiner Tree Problem in Orientation Metrics

Albrecht

Young

et al. 1997

Journal of Computer and System Sciences

View full text Add to dashboard Cite

Given a set 3 of : 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]. Specifically, if there are _ orientations, forming angles i?Â_, 0 i _&1, with the x-axis, where _ 2 is an integer, we call the metric a * _ -metric. Note that the * 2 -metric is the well-known rectilinear metric and the * corresponds to the Euclidean metric. In this paper, we will concentrate on the * 3 -metric. In the * 2 -metric, Hanan has shown 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. In this paper, we mainly prove the following theorem: Let P, Q, and O i (i=1, 2, ..., k) be the set of n demand points, the set of Steiner points, and the set of the i th generation intersection points, respectively. Then there exists a solution G of the Steiner problem S n such that all Steiner points are in

show abstract

On a multinet wiring problem

Cited by 12 publications

References 5 publications

Optimal Interconnection Trees in the Plane

Optimal Interconnection Trees in the Plane

Steiner tree problems

The Steiner Tree Problem in Orientation Metrics

Contact Info

Product

Resources

About