✦ LIBER ✦

The steiner tree packing problem in VLSI design

✍ Scribed by M. Grötschel; A. Martin; R. Weismantel

Book ID: 110591393
Publisher: Springer-Verlag
Year: 1997
Tongue: English
Weight: 916 KB
Volume: 78
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf02614374

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Rectilinear group Steiner trees and appl

Rectilinear group Steiner trees and applications in VLSI design

✍ Martin Zachariasen; André Rohe 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 214 KB

The Steiner tree problem

✍ Dirk van Oudheusden 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 87 KB

The full Steiner tree problem

✍ Chin Lung Lu; Chuan Yi Tang; Richard Chia-Tung Lee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 358 KB

Motivated by the reconstruction of phylogenetic tree in biology, we study the full Steiner tree problem in this paper. Given a complete graph G = (V; E) with a length function on E and a proper subset R ⊂ V , the problem is to ÿnd a full Steiner tree of minimum length in G, which is a kind of Steine

The 1-steiner tree problem

✍ George Georgakopoulos; Christos H Papadimitriou 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 480 KB

Packing the Steiner trees of a graph

✍ L. Petingi; M. Talafha 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

The Steiner Tree Problem in Orientation

The Steiner Tree Problem in Orientation Metrics

✍ G.Y. Yan; A. Albrecht; G.H.F. Young; C.K. Wong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Given a set 3 of : i (i=1, 2, ..., k) orientations (angles) in the plane, one can define a distance function which induces a metric in the plane, called the orientation metric [3]. In the special case where all the angles are equal, we call the metric a uniform orientation metric [2]. Specifically,