✦ LIBER ✦

A note on Steiner tree games

✍ Scribed by Darko Skorin-Kapov; Jadranka Skorin-Kapov

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 202 KB
Volume: 59
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20436

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A note concerning asymmetric games on gr

A note concerning asymmetric games on graphs

✍ Alvin E. Roth 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

## Abstract We consider a class of asymmetric two‐person games played on graphs, and characterize all the positions in the game.

Packing the Steiner trees of a graph

✍ L. Petingi; M. Talafha 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

A note on bisecting minimum spanning tre

A note on bisecting minimum spanning trees

✍ W. M. Boyce; M. R. Garey; D. S. Johnson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

A note on finding shortest path trees

✍ Aaron Kershenbaum 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB 👁 1 views

A note on trees, tables, and algorithms

✍ Wayne Goddard; Stephen T. Hedetniemi 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB