Abstract
In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, no two terminals on the same horizontal or vertical line, we need to construct a network N(T) of minimum total length with the property that the edges of N(T) belong to the axis-parallel grid defined by T and are oriented in a such a way that every ordered pair of terminals is connected in N(T) by a directed Manhattan path. In this article, we present a polynomial factor 2-approximation algorithm for the bidirected minimum Manhattan network problem. © 2016 Wiley Periodicals, Inc. NETWORKS, 2016
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.
