The rectilinear Steiner arborescence problem is NP-complete
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The repeater tree construction problem
Information Processing Letters
Mathematical Programming: Series A and B
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Provably good performance-driven global routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A fast algorithm for rectilinear steiner trees with length restrictions on obstacles
Proceedings of the 2014 on International symposium on physical design
| Hi-index | 0.00 |
We consider the problem of constructing a Steiner arborescence broadcasting a signal from a root r to a set T of sinks in a metric space, with out-degrees of Steiner vertices restricted to 2. The arborescence must obey delay bounds for each r-t-path (t∈T), where the path delay is imposed by its total edge length and its inner vertices. We want to minimize the total length. Computing such arborescences is a central step in timing optimization of VLSI design where the problem is known as the repeater tree problem [1,5]. We prove that there is no constant factor approximation algorithm unless $\mbox{\slshape P}=\mbox{\slshape NP}$ and develop a bicriteria approximation algorithm trading off signal speed (shallowness) and total length (lightness). The latter generalizes results of [8,3], which do not consider vertex delays. Finally, we demonstrate that the new algorithm improves existing algorithms on real world VLSI instances.