Bidirected minimum Manhattan network problem

Nicolas Catusse; Victor Chepoi; Karim Nouioua; Yann Vaxès

doi:10.1002/net.21719

Journal articles

Bidirected minimum Manhattan network problem

Nicolas Catusse ¹ Victor Chepoi ^{2, 3} Karim Nouioua ^{2, 3} Yann Vaxès ^{2, 3}

1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production

G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production

2 ACRO - Algorithmique, Combinatoire et Recherche Opérationnelle

LIS - Laboratoire d'Informatique et Systèmes

3 LIF - Laboratoire d'informatique Fondamentale de Marseille

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.

Document type :

Journal articles

Domain :

Computer Science [cs] / Discrete Mathematics [cs.DM]

Computer Science [cs] / Computational Geometry [cs.CG]

Computer Science [cs] / Data Structures and Algorithms [cs.DS]

Mathematics [math] / Combinatorics [math.CO]

Mathematics [math] / Metric Geometry [math.MG]

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

Bidirected minimum Manhattan network problem

File

Identifiers

Collections

Citation

Export

Metrics

359

277

Bidirected minimum Manhattan network problem

File

Identifiers

Collections

Citation

Export

Share

Metrics

359

277