Bidirected minimum Manhattan network problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Networks Année : 2017

Bidirected minimum Manhattan network problem

Résumé

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.
Fichier principal
Vignette du fichier
1107.1359.pdf (187.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02268714 , version 1 (20-05-2020)

Identifiants

Citer

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

Altmetric

Partager

Gmail Facebook X LinkedIn More