Abstract
We consider the problem Rectilinear Class Steiner Tree (channel) where we have pairwise not intersecting intervals of required points, partitioned into so called classes, lying on two parallel horizontal lines in the plane. A shortest rectilinear tree is to be found, connecting at least one point of each class. One of our results shows that Rectilinear Class Steiner Tree (channel) is NP-hard, even if each class consists of at most three single points. But we give an exact algorithm that has linear time complexity, if roughly spoken for no vertical line more than a constant number of classes contain points on the right and also not on the right side of this line.
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.
