M. Benkert, A. Wolff, F. Widmann, and T. Shirabe, The minimum Manhattan network problem: approximations and exact solutions, Comput. Geom, vol.35, pp.188-208, 2006.

N. Catusse, V. Chepoi, K. Nouioua, and Y. Vaxès, Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01194801

V. Chepoi, K. Nouioua, and Y. Vaxès, A rounding algorithm for approximating minimum Manhattan networks, Theor. Comput. Sci, vol.390, pp.40-51, 2008.

F. Y. Chin, Z. Guo, and H. Sun, Minimum Manhattan network is NP-complete, Symposium on Computational Geometry, pp.393-402, 2009.

T. Y. Chung and D. P. , On network characterization of an optimal broadcasting in the Manhattan Street Network, INFOCOM, pp.465-472, 1990.

D. Eppstein, Spanning trees and spanners, Handbook of Computational Geometry, pp.425-461, 2000.

B. Fuchs and A. Schulze, A simple 3-approximation of minimum Manhattan networks, CTW 2008, pp.26-29

Z. Guo, H. Sun, and H. Zhu, A fast 2-approximation algorithm for the minimum Manhattan network problem, Proc. 4th International Conference on Algorithmic Aspects in Information Management, vol.5034, pp.212-223, 2008.

Z. Guo, H. Sun, and H. Zhu, Greedy construction of 2-approximation minimum Manhattan network, 19th International Symposium on Algorihtms and Computation, vol.5369, pp.4-15, 2008.

J. Gudmundsson, C. Levcopoulos, and G. Narasimhan, Approximating a minimum Manhattan network, Nordic J. Computing, vol.8, pp.28-37, 2001.

J. Gudmundsson, R. Klein, G. Narasimhan, M. Smid, and A. Wolff, 06481 Abstracts Collection -Geometric Networks and Metric Space Embeddings, Internationales Begegnungs-und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, 2007.

R. Kato, K. Imai, and T. Asano, An improved algorithm for the minimum Manhattan network problem, 13th International Symposium on Algorihtms and Computation, vol.2518, pp.344-356, 2002.

F. Lam, M. Alexanderson, and L. Pachter, Picking alignements from (Steiner) trees, J. Comput. Biol, vol.10, pp.509-520, 2003.

N. F. Maxemchuk, Routing in the Manhattan Street Network, IEEE Trans. Commun, vol.35, pp.503-512, 1987.

G. Narasimhan and M. Smid, Geometric Spanner Networks, 2007.

K. Nouioua, Enveloppes de Pareto et Réseaux de Manhattan: caractérisations et algorithmes, 2005.

L. Roditty, M. Thorup, and U. Zwick, Roundtrip spanners and roundtrip routing in directed graphs, pp.844-851, 2002.

S. Seibert and W. Unger, A 1.5-approximation of the minimal Manhattan network, 16th International Symposium on Algorihtms and Computation, vol.3827, pp.246-255, 2005.
URL : https://hal.archives-ouvertes.fr/in2p3-00005279

A. Schulze, Approximation Algorithms for Network Design Problems, 2008.

E. A. Varvarigos, Optimal communication algorithms for Manhattan Street Networks, Discrete Appl. Math, vol.83, pp.303-326, 1998.