✦ LIBER ✦

On minimal H-sets

✍ Scribed by G.D Taylor

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 270 KB
Volume: 5
Category: Article
ISSN: 0021-9045
DOI: 10.1016/0021-9045(72)90033-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal H-sets and unicity of best appro

Minimal H-sets and unicity of best approximations

✍ Lee W Johnson 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 131 KB

One-dimensional minimal sets

✍ E.S. Thomas Jr. 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 726 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

On the minimal covering of infinite sets

✍ J. Klimó 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 497 KB

Almost periodic minimal sets

✍ Guy Allaud; E.S Thomas Jr. 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Minimal Gerschgorin sets, III

✍ B.W. Levinger 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 338 KB