P. Berman, U. Foessmeier, M. Karpinski, M. Kaufmann, and A. Z. Zelikovsky, Approaching the 5/4 - Approximation for Rectilinear Steiner Trees, Tech. Rep. WSI-94-06, Wilhelm Schickard-Institut fur Informatik, 1994. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Closing the Gap: Near-Optimal Steiner Trees in Polynomial .. - Griffith, Robins.. (1994) (9 citations) (Correct)
....computationally expensive part of global routing, our parallel implementation may be viewed as an important first step toward obtaining a Steiner engine , i.e. an efficient tool for producing near optimal Steiner trees. 1 Recently, Berman and Ramaiyer [7] and Foessmeier, Kaufmann and Zelikovsky [6] [13] have extended the fundamental work of Zelikovsky [46] 47] to yield a method similar to I1S (specifically, to the batched I1S method described below) with performance ratio bounded by 11 8 ; this work settles in the affirmative the longstanding open question of whether there exists a ....
P. Berman, U. Foessmeier, M. Karpinski, M. Kaufmann, and A. Z. Zelikovsky, Approaching the 5/4 - Approximation for Rectilinear Steiner Trees, Tech. Rep. WSI-94-06, Wilhelm Schickard-Institut fur Informatik, 1994.
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