Abstract
We consider the Minimum Manhattan Subnetwork (MMSN) Problem which generalizes the already known Minimum Manhattan Network (MMN) Problem: Given a set P of n points in the plane, find shortest rectilinear paths between all pairs of points. These paths form a network, the total length of which has to be minimized. From a graph theoretical point of view, a MMN is a 1-spanner with respect to the L 1 metric. In contrast to the MMN problem, a solution to the MMSN problem does not demand L 1 -shortest paths for all point pairs, but only for a given set R ⊆ P × P of pairs. The complexity status of the MMN problem is still unsolved in ≥2 dimensions, whereas the MMSN was shown to be N P -complete considering general relations R in the plane. We restrict the MMSN problem to transitive relations R T ( Transitive Minimum Manhattan Subnetwork (TMMSN) Problem) and show that the TMMSN problem in 3 dimensions is N P -complete.
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.
