B. Ben-moshe, M. J. Katz, and J. S. Mitchell, A Constant???Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding, SIAM Journal on Computing, vol.36, issue.6, pp.1631-1647, 2007.
DOI : 10.1137/S0097539704446384

C. Berge, Balanced matrices, Mathematical Programming, pp.19-31, 1972.
DOI : 10.1007/BF01584535

H. Brönnimann and M. T. Goodrich, Almost optimal set covers in finite VC-dimension, Discrete & Computational Geometry, vol.16, issue.2, pp.463-479, 1995.
DOI : 10.1007/BF02570718

D. Z. Chen, V. Estivill-castro, and J. Urrutia, Optimal guarding of polygons and monotone chains, Proceedings of the 7th Canadian Conference on Computational Geometry, pp.133-138, 1995.

K. L. Clarkson and K. R. Varadarajan, Improved approximation algorithms for geometric set cover, Proceedings of the 20th Symposium on Computational Geometry, pp.135-141, 2005.

E. D. Demaine and J. O-'rourke, Open problems: Open problems from CCCG, Proceedings of the 18th Canadian Conference on Computational Geometry, pp.75-80, 2005.

K. Elbassioni, D. Matijevi´cmatijevi´c, J. Mestre, and D. Severdija, Improved Approximations for Guarding 1.5-Dimensional Terrains, Algorithmica, vol.6, issue.3, 2008.
DOI : 10.1007/s00453-009-9358-4
URL : https://hal.archives-ouvertes.fr/inria-00359652

N. Garg and J. Könemann, Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems, 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.300-309, 1998.
DOI : 10.1137/S0097539704446232

D. R. Gaur, T. Ibaraki, and R. Krishnamurti, Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem, Journal of Algorithms, vol.43, issue.1, pp.138-152, 2002.
DOI : 10.1006/jagm.2002.1221

R. L. Graham, An efficient algorith for determining the convex hull of a finite planar set, Information Processing Letters, vol.1, issue.4, pp.132-133, 1972.
DOI : 10.1016/0020-0190(72)90045-2

R. Hassin and D. Segev, Rounding to an integral program, Operations Research Letters, vol.36, issue.3, pp.321-326, 2008.
DOI : 10.1016/j.orl.2007.11.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.9613

A. J. Hoffman, A. Kolen, and M. Sakarovitch, Totally-Balanced and Greedy Matrices, SIAM Journal on Algebraic Discrete Methods, vol.6, issue.4, pp.721-730, 1985.
DOI : 10.1137/0606070

J. King, Errata on " A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains

J. King, A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains, Proceedings of the 13th Latin American Symposium on Theoretical Informatics, pp.629-640, 2006.
DOI : 10.1007/11682462_58

J. King, VC-dimension of visibility on terrains, Proceedings of the 20th Canadian Conference on Computational Geometry, pp.27-30, 2008.

A. Kolen, Location problems on trees and in the rectilinear plane, Matematisch Centrum, 1982.

C. Koufogiannakis and N. E. Young, Beating Simplex for Fractional Packing and Covering Linear Programs, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), pp.494-504, 2007.
DOI : 10.1109/FOCS.2007.62

C. Koufogiannakis and N. E. Young, Beating simplex for fractional packing and covering linear programs . CoRR, abs/0801, 1987.

E. Krohn, Survey of terrain guarding and art gallery problems. Unpublished manuscript, 2007.

J. Mestre, Lagrangian relaxation and partial cover (extended abstract), Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, pp.539-550, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00232974

S. A. Plotkin and D. B. Shmoys, Fast approximation algorithms for fractional packing and covering problems, 32nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp.495-504, 1991.