✦ LIBER ✦

The Steiner problem on a surface

✍ Scribed by Jiang Xin-yao

Publisher: Springer
Year: 1987
Tongue: English
Weight: 273 KB
Volume: 8
Category: Article
ISSN: 0253-4827
DOI: 10.1007/bf02454259

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Conversion of the Steiner Problem on the

Conversion of the Steiner Problem on the Euclidean Plane to the Steiner Problem on Graph

✍ D. T. Lotarev; A. P. Uzdemir 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 158 KB

A Steiner problem on finite sets

✍ V. Ya. Burdyuk; N. G. Novikova 📂 Article 📅 1980 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 230 KB

Steiner polygons in the Steiner problem

✍ Jia Feng Weng 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 459 KB

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

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

On a problem of H.-G. Steiner

✍ Hans Zassenhaus 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 269 KB