By Topic

Approximation algorithms for the rectilinear Steiner tree problem with obstacles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Fujimoto, M. ; Graduate Sch. of Eng., Hiroshima Univ., Japan ; Takafuji, D. ; Watanabe, T.

The rectilinear Steiner tree problem with a family D of obstacles H[Di] (1 ≤ i ≤ δ = |D|) is defined as follows: given a rectangular grid graph H = (N, A), a family D of obstacles, and a set P of terminals not contained in any obstacle, find a rectilinear Steiner tree connecting P in H - ∪DiεD Di. The case with edge weight being unity is exclusively considered in the paper. First, for the case with D = 0, we propose approximation algorithms by improving those which are already existing. Secondly, we propose other capable approximation algorithms by extending existing ones so that the case with D ≠ 0 may be handled. Evaluation of their performance through experimental results is given.

Published in:

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Date of Conference:

23-26 May 2005