Opening book details…
Can I read An Improved Program for the Full Steiner Tree Problem on EtoBox?
An Improved Program for the Full Steiner Tree Problem by William M. Boyce is a Computer Science article available to read on EtoBox.
What is An Improved Program for the Full Steiner Tree Problem about?
A network of minimum total length which connects a given finite planar set A is a union of special trees called full Steiner minimal trees (FSMT), each of which is necessarily also a minimum full Steiner tree (MFST). Extending the earlier work of E.J. Cockayne, we consider the problem of computationally establishing whether there exists an MFST for a given planar set, and if so, exhibiting one. In addition to clarifying the distinction between FSMTs and MFSTs, we are able to revise the computational algorithm so as to speed up Cockayne's program by over an order of magnitude.
Who reads An Improved Program for the Full Steiner Tree Problem?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- William M. Boyce
- Publisher
- ACM
- Published
- 1977
- Language
- EN
- Field
- Computer Science (Physical Sciences)