J. L. Ganley, Geometric interconnection and placement algorithms, Ph.D. Dissertation, The University of Virginia, May 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A New Exact Algorithm for Rectilinear Steiner Trees - David Warme April (1997) (4 citations) (Correct)
....a lower bound estimate on the wire length of a route connecting all of the devices together. An RSMT of the points represents only a lower bound since a real interconnect satisfies additional constraints requiring it to avoid other obstacles that are also present on the chip. Recent work by Ganley [6] treated such obstacle avoiding RSMTs directly. In addition to global wire length estimation, RSMTs have also been used to evaluate the merit of functional block placements in floor planners such as the MONDRIAN system [6] Many of these applications require the solution of problem instances ....
....other obstacles that are also present on the chip. Recent work by Ganley [6] treated such obstacle avoiding RSMTs directly. In addition to global wire length estimation, RSMTs have also been used to evaluate the merit of functional block placements in floor planners such as the MONDRIAN system [6]. Many of these applications require the solution of problem instances containing many hundreds or even thousands of terminals. Provably optimal solutions to such instances were well beyond the capabilities of previous methods, but are becoming feasible with the algorithm presented here. 2 ....
J. L. Ganley, Geometric interconnection and placement algorithms, Ph.D. Dissertation, The University of Virginia, May 1995.
On Approximation of the Power-p and Bottleneck Steiner Trees - Berman, Zelikovsky (Correct)
....trees, since all approximations of classical Steiner trees heavily rely on the triangle inequality for the shortest path weight. 2 Performance ratio of an approximation algorithm is an upper bound on the ratio of the output cost of this algorithm over the optimum cost. 3 It was conjectured in [6] that the power p Steiner ratio ae p is finite. In Section 3 we prove that this conjecture is true, i.e. that the power p Steiner ratio ae p is constant for any p. In particular, for p = 2, we show that the minimum spanning tree is at most 23.3 times worse than the optimum. But we do not think ....
J. L. Ganley, Geometric interconnection and placement algorithms, PhD thesis, Dept of CS, University of Virginia, 1995.
A New Exact Algorithm for Rectilinear Steiner Trees - Warme (1997) (4 citations) (Correct)
....represents only a lower bound since a real interconnect satisfies additional constraints requiring it to avoid other obstacles that are also present on the chip. Recent work Figure 2: A Euclidean Steiner minimal tree for 100 terminals. Problem 1 from ORlibrary estein100.txt file. by Ganley [8] treated such obstacle avoiding RSMTs directly. In addition to global wire length estimation, RSMTs have also been used to evaluate the merit of functional block placements in floor planners such as the MONDRIAN system [8] Many of these applications require the solution of problem instances ....
....for 100 terminals. Problem 1 from ORlibrary estein100.txt file. by Ganley [8] treated such obstacle avoiding RSMTs directly. In addition to global wire length estimation, RSMTs have also been used to evaluate the merit of functional block placements in floor planners such as the MONDRIAN system [8]. Many of these applications require the solution of problem instances containing many hundreds or even thousands of terminals. Provably optimal solutions to such instances were well beyond the capabilities of previous methods, but are becoming feasible with the algorithm presented here. 2 ....
J. L. Ganley, Geometric interconnection and placement algorithms, Ph.D. Dissertation, The University of Virginia, May 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC