Given a nite set V of points in the plane (called terminals), the rectilinear Steiner minimal tree is a shortest network of horizontal and vertical lines connecting all the terminals of V. Theâ€¦ (More)

A new two-way multiple-input multiple-output (MIMO) channel sounding method for enabling a transmitter and a receiver both to have complete knowledge of the channel between them is presented. The keyâ€¦ (More)

Given a set of terminals in the plane, a rectilinear Steiner minimal tree is a shortest intercon-nection among these terminals using only horizontal and vertical edges. We present an algorithm thatâ€¦ (More)

Given a set of terminals in the plane, a rectilin-ear Steiner minimal tree is a shortest interconnection among these terminals using only horizontal and vertical edges. We present an algorithm thatâ€¦ (More)

We give an overview of recent exact algorithms for the Euclidean and rectilinear Steiner tree problems in the plane. Large-scale problem instances with more than 2000 terminals have been solved toâ€¦ (More)