Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.