ECM - École Centrale de Marseille : UMR7279 (Pôle de l'étoile - Technopole de Château-Gombert - 38 rue Frédéric Joliot-Curie - 13013 Marseille - France)
Abstract : In the bidirected minimum Manhattan network problem, given a set T of n terminals in the plane, we need to construct a network N (T) of minimum total length with the property that the edges of N (T) are axis-parallel and oriented in a such a way that every ordered pair of terminals is connected in N (T) by a directed Manhattan path. In this paper, we present a polynomial factor 2 approximation algorithm for the bidirected minimum Manhattan network problem.
https://hal.archives-ouvertes.fr/hal-02268714
Contributor : Victor Chepoi <>
Submitted on : Wednesday, May 20, 2020 - 12:38:25 PM Last modification on : Thursday, November 19, 2020 - 2:48:03 PM