U. Foessmeier, M. Kaufmann, and A. Z. Zelikovsky, Fast Approximation Algorithms for the Rectilinear Steiner Tree Problem, Tech. Rep. WSI-93-14, Wilhelm Schickard-Institut fur Informatik, 1993.  Home/Search   Document Not in Database   Summary   Related Articles

....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 ....

.... by 11 8 ; this work settles in the affirmative the longstanding open question of whether there exists a polynomial time rectilinear Steiner tree heuristic with performance ratio strictly smaller than 3 2 [25] At the time of this writing, Berman, Foessmeier, Karpinski, Kaufmann and Zelikovsky [13] further improved the performance bound of their polynomial time rectilinear Steiner heuristic to 61 48 = 1:271. Our third contribution entails several performance improving enhancements to the I1S method. Our methods rely on an approach that deviates from pure greed and instead employs ....

U. Foessmeier, M. Kaufmann, and A. Z. Zelikovsky, Fast Approximation Algorithms for the Rectilinear Steiner Tree Problem, Tech. Rep. WSI-93-14, Wilhelm Schickard-Institut fur Informatik, 1993.

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