COMPUTER SCIENCE COLLOQUIUM

Flexibility of Steiner Trees in Uniform Orientation Metrics

Pawel Winter and Martin Zachariasen Department of Computer Science University of Copenhagen

Tuesday, March 30, 2004, at 14:15 Seminar Room

ABSTRACT

We present some fundamental flexibility properties for minimum length networks (known as Steiner minimum trees) interconnecting a given set of points in an environment in which edge segments are restricted to λ uniformly oriented directions. These networks are referred to as λ-SMTs. They promise to play an increasingly important role in the future of optimal wire routing in VLSI physical design, particularly for the next generation of VLSI circuits.

Host: Kim Skak Larsen

---

SDU HOME | IMADA HOME | Previous Page

---

Last modified: March 23, 2004.

Joan Boyar (joan@imada.sdu.dk)