✦ LIBER ✦

A Steiner problem on finite sets

✍ Scribed by V. Ya. Burdyuk; N. G. Novikova

Publisher: SP MAIK Nauka/Interperiodica
Year: 1980
Tongue: English
Weight: 230 KB
Volume: 28
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01140136

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a distribution problem in finite sets

✍ H.G Meijer 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 424 KB

The Steiner problem on a surface

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

A Ramsey theoretic problem for finite or

A Ramsey theoretic problem for finite ordered sets

✍ H.A. Kierstead; W.T. Trotter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 467 KB

In this paper, we consider the following Ramsey theoretic problem for finite ordered sets: For each II 3 1, what is the least integer f(n) so that for every ordered set P of width it, there exists an ordered set Q of width f(n) such that every 2-coloring of the points of Q produces a monochromatic

On a problem of H.-G. Steiner

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

An intersection problem for finite sets

✍ P. Frankl 📂 Article 📅 1977 🏛 Akadmiai Kiad 🌐 English ⚖ 137 KB

Full Minimal Steiner Trees on Lattice Se

Full Minimal Steiner Trees on Lattice Sets

✍ M. Brazil; J.H. Rubinstein; D.A. Thomas; J.F. Weng; N.C. Wormald 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Given a finite set of points P in the Euclidean plane, the Steiner problem asks us to constuct a shortest possible network interconnecting P. Such a network is known as a minimal Steiner tree. The Steiner problem is an intrinsically difficult one, having been shown to be NP-hard [7]; however, it oft