✦ LIBER ✦

A note on boundingk-terminal reliability

✍ Scribed by Charles J. Colbourn

Book ID: 105301244
Publisher: Springer
Year: 1992
Tongue: English
Weight: 261 KB
Volume: 7
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01758764

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A general note on structural reliability

✍ J.T.P. Yao 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 178 KB

A Note on Hyperspaces and Terminal Coalg

A Note on Hyperspaces and Terminal Coalgebras

✍ Franck van Breugel; Stephen Watson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 130 KB

Note on reliability of a system complexi

Note on reliability of a system complexity

✍ T. Nakagawa; K. Yasui 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 419 KB

Most systems have been recently complicated with remarkable development of their high performances. Both hardware and softavare become redundant, and sometimes, serious problems of interference between them might be newly generated. It would be inappropriate to calculate the reliabilities of such co

A note on solving a system reliability p

A note on solving a system reliability problem

✍ Jsun Y. Wong 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Note on integrity versus reliability

✍ Duncan Badenius 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 257 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