@ARTICLE{Zachariasen00acatalog, author = {Martin Zachariasen}, title = {A Catalog of Hanan Grid Problems}, journal = {Networks}, year = {2000}, volume = {38}, pages = {200--1} }

Share

OpenURL

Abstract

We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including --- but not limited to --- Steiner trees for rectilinear (or isothetic) polygons, obstacle-avoiding Steiner trees, group Steiner trees and prize-collecting Steiner trees. Also, the weighted region Steiner tree problem is shown to be solvable on the Hanan grid; this problem has natural applications in VLSI design routing. Finally, we give similar results for other rectilinear problems. 1 Introduction Assume we are given a finite set of points S in the plane. The Hanan grid H(S) of S is obtained by constructing vertical and horizontal lines through each point in S. The main motivation for studying the Hanan grid stems from the fact that it is known to contain a rectilinear Steiner minimum tree (RSMT)...