| Article ID: | iaor1995253 |
| Country: | Netherlands |
| Volume: | 47 |
| Issue: | 2 |
| Start Page Number: | 187 |
| End Page Number: | 206 |
| Publication Date: | Nov 1993 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Winter Pawel |
| Keywords: | Steiner problem |
The notion of Steiner visibility graphs is introduced. Their applicability in connection with the construction of good quality suboptimal solutions to the Euclidean Steiner tree problem with obstacles is discussed. Polynomial algorithms generating Steiner visibility graphs are described.