✦ LIBER ✦

The Steiner tree problem with hop constraints

✍ Scribed by S. Voß

Book ID: 110380246
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 271 KB
Volume: 86
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018967121276

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Models and branch-and-cut algorithms for

Models and branch-and-cut algorithms for the Steiner tree problem with revenues, budget and hop constraints

✍ Alysson M. Costa; Jean-François Cordeau; Gilbert Laporte 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

The Steiner tree problem

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

Using the Miller-Tucker-Zemlin constrain

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints

✍ Luis Gouveia 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 871 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

On the terminal Steiner tree problem

✍ Guohui Lin; Guoliang Xue 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 69 KB

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio