✦ LIBER ✦

On a problem of H.-G. Steiner

✍ Scribed by Hans Zassenhaus

Publisher: Elsevier Science
Year: 1970
Tongue: English
Weight: 269 KB
Volume: 2
Category: Article
ISSN: 0022-314X
DOI: 10.1016/0022-314x(70)90059-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Problem of G. G. Lorentz

✍ Allan Pinkus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 235 KB

On a problem of G. Freud

✍ H.N Mhaskar 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 388 KB

A note on “A faster approximation algori

A note on “A faster approximation algorithm for the Steiner problem in graphs”

✍ Rolf Floren 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Notes on a Problem of H. Cohn

✍ András Biró 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We prove some partial results concerning the following problem: Assume that F is a finite field, a i is a complex number for each i # F such that a 0 =0, a 1 =1, |a i | =1 for all i # F "[0], and i # F a i+j aÄ i =&1 for all i # F "[0]. Does it follow that the function i Ä a i is a multiplicative ch

Some generalizations of the steiner prob

Some generalizations of the steiner problem in graphs

✍ C. W. Duin; A. Volgenant 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

The Steiner Problem in Graphs (SP) is the problem of finding a set of edges with minimum total weight which connects a given subset of nodes in an edge-weighted (undirected) graph. In the more general Node-weighted Steiner Problem (NSP) also node weights are considered. A restricted minimum spanning

On a coin tossing problem by G. Bennett

✍ Helge Tverberg 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 103 KB

Tverberg, H., On a coin tossing problem by G. Bennett, Discrete Mathematics 115 (1993) 293-294. For a certain class of games, Bennett proved that player B never has a smaller chance of winning than player A. Here we give a proof which keeps strictly to the original problem environment. Bennett [ 1