Skip to Main content Skip to Navigation
Journal articles

Bidirected minimum Manhattan network problem

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.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

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

File

1107.1359.pdf
Files produced by the author(s)

Identifiers

Citation

Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès. Bidirected minimum Manhattan network problem. Networks, Wiley, 2017, 69 (2), pp.167-178. ⟨10.1002/net.21719⟩. ⟨hal-02268714⟩

Share

Metrics

Record views

359

Files downloads

277