Abstract
For a finite set of points in a Minkowski-space a Steiner-Minimal-Tree (SMT) is a shortest tree which interconnects these points. Since the determination of an SMT is unknown or at least NP-hard, we introduce a 1-SMT problem in the way that we allow only one new vertex in the tree. The degrees of vertices in such trees have some restrictions. Consequently, it is possible to solve the 1-SMT problem in polynomial bounded time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
