Minimum moment Steiner trees

For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path in T from the root to u, and du is the incremental edge length. Given a set of points P in the plane, a k-th moment Steiner Minimum Tree (k-SMT) is a rectilinear Steiner tree that has the minimum k-th moment among all rectilinear Steiner trees for P, with the origin as the root. The definition is a natural extension of the traditional Steiner minimum tree, and motivated by application in VLSI routing. In this paper properties of the kSMT are studied and approximation algorithms are presented.

• Type: Conference
• Year: 2004
• Where: SODA
• Authors: Wangqi Qiu, Weiping Shi
• Keywords: Algorithms, K-th Moment, Rectilinear Steiner Trees, SODA 2004, Steiner Minimum Tree