Minimum moment Steiner trees

Authors:
Wangqi Qiu;Weiping Shi
Affiliations:
Texas A&M University, College Station, Texas;Texas A&M University, College Station, Texas
Venue:
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2004

Citing 3
Cited 1

Performance-driven interconnect design based on distributed RC delay model

DAC '93 Proceedings of the 30th international Design Automation Conference
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The rectilinear Steiner arborescence problem is NP-complete

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms

Timing-driven Steiner trees are (practically) free

Proceedings of the 43rd annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a rectilinear Steiner tree T with a root, define its k-th momentMk(T)= ∫T(dT(u))kduwhere 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 k-SMT are studied and approximation algorithms are presented.