New approximations for the rectilinear Steiner arborescence problem [VLSI layout]

Authors:
S. Ramnath
Affiliations:
Dept. of Comput. Sci., St. Cloud State Univ., MN, USA
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Year:
2006

Citing 0
Cited 4

Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem

Proceedings of the 2004 ACM symposium on Applied computing
A tree-based genetic algorithm for building rectilinear Steiner arborescences

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Computational geometry II

Algorithms and theory of computation handbook
Angle-restricted steiner arborescences for flow map layout

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation

Quantified Score

Hi-index	0.03

Visualization

Abstract

A new approach for approximating the minimum rectilinear Steiner arborescence is presented. The approach yields a simple two-approximation algorithm that runs in O(nlogn) time. Unlike earlier approaches, this can be naturally extended to deal with situations where we have isothetic rectilinear obstacles. This gives us the first O(nlogn) two-approximation algorithm for the rectilinear Steiner arborescence problem in the presence of obstacles.