𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal technicolor on the lattice

✍ Scribed by Ari Hietanen; Jarno Rantaharju; Kari Rummukainen; Kimmo Tuominen

Book ID
108226857
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
223 KB
Volume
820
Category
Article
ISSN
0375-9474

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimal path on the hierarchical diamond
Minimal path on the hierarchical diamond lattice
✍ StΓ©phane Roux; Alex Hansen; Luciano R. da Silva; Liacir S. Lucena; Ras B. Pandey πŸ“‚ Article πŸ“… 1991 πŸ› Springer 🌐 English βš– 951 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