✦ LIBER ✦

Steiner trees in probabilistic networks

✍ Scribed by Joseph A. Wald; Charles J. Colbourn

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 332 KB
Volume: 23
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(83)91008-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Steiner trees in probabilistic networks : Joseph A. Wald and Charles J. Colbourn. Microelectron. Reliab.23 (5), 837 (1983)

📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 133 KB

Probabilistic models for the Steiner Tre

Probabilistic models for the Steiner Tree problem

✍ Vangelis Th. Paschos; Orestis A. Telelis; Vassilis Zissimopoulos 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

Steiner trees, partial 2–trees, and mini

Steiner trees, partial 2–trees, and minimum IFI networks

✍ Joseph A. Wald; Charles J. Colbourn 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

Steiner trees, partial 2–trees, and mini

Steiner trees, partial 2–trees, and minimum IFI networks

✍ Joseph A. Wald; Charles J. Colbourn 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

Faster exact algorithms for steiner tree

Faster exact algorithms for steiner trees in planar networks

✍ Marshall Bern 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.

Probabilistic analysis of an lp relaxati

Probabilistic analysis of an lp relaxation bound for the steiner problem in networks

✍ Anjani Jain 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 395 KB