✦ LIBER ✦

On the terminal Steiner tree problem

✍ Scribed by Guohui Lin; Guoliang Xue

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 69 KB
Volume: 84
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00227-2

No coin nor oath required. For personal study only.

✦ Synopsis

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 ρ + 2, where ρ is the best-known approximation ratio for the graph Steiner tree problem.

📜 SIMILAR VOLUMES

A note on the terminal Steiner tree prob

A note on the terminal Steiner tree problem

✍ Bernhard Fuchs 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 53 KB

In 2002, Lin and Xue [Inform. Process. Lett. 84 (2002) 103-107] introduced a variant of the graph Steiner tree problem, in which each terminal vertex is required to be a leaf in the solution Steiner tree. They presented a ρ + 2 approximation algorithm, where ρ is the approximation ratio of the bes

The Steiner tree problem for terminals o

The Steiner tree problem for terminals on the boundary of a rectilinear polygon

✍ Siu-Wing Cheng 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 233 KB

Given a simple rectilinear polygon P with k sides and n terminals on its boundary, we present an O(k 3 n)-time algorithm to compute the minimal rectilinear Steiner tree lying inside P interconnecting the terminals. We obtain our result by proving structural properties of a selective set of minimal S

The Steiner tree problem

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

The 1-steiner tree problem

✍ George Georgakopoulos; Christos H Papadimitriou 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 480 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

On the approximability of the Steiner tr

On the approximability of the Steiner tree problem

✍ Martin Thimm 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 165 KB

We show that it is not possible to approximate the minimum Steiner tree problem within 1 + 1 162 unless RP = NP. The currently best known lower bound is 1 + 1 400 . The reduction is from H astad's nonapproximability result for maximum satisÿability of linear equation modulo 2. The improvement on the