✦ LIBER ✦

A Bound for the Lengths of Arcs in Steiner Systems

✍ Scribed by Ryuzaburo Noda

Publisher: Springer Japan
Year: 1999
Tongue: English
Weight: 54 KB
Volume: 15
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050067

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximations and Lower Bounds for the

Approximations and Lower Bounds for the Length of Minimal Euclidean Steiner Trees

✍ J. H. Rubinstein; J. Weng; N. Wormald 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 187 KB

A bound of the exterior arcs for a univa

A bound of the exterior arcs for a univalent mapping

✍ Yu. A. Litvinchuk; I. M. Milin 📂 Article 📅 1975 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 410 KB

A tight lower bound for the Steiner rati

A tight lower bound for the Steiner ratio in Minkowski planes

✍ Biao Gao; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 804 KB

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

A lower bound for the length of addition

A lower bound for the length of addition chains

✍ Arnold Schönhage 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 516 KB

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