✦ LIBER ✦

On multiple steiner subgraph problems

✍ Scribed by M. B. Richey; R. Gary Parker

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 752 KB
Volume: 16
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230160408

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ramsey problem on multiplicities of comp

Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs

✍ F. Franek; V. Rödl 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 461 KB

Approximations to clustering and subgrap

Approximations to clustering and subgraph problems on trees

✍ Rainer Schrader 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 537 KB

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

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

The Steiner problem on a surface

✍ Jiang Xin-yao 📂 Article 📅 1987 🏛 Springer 🌐 English ⚖ 273 KB

A Steiner problem on finite sets

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