Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line
暂无分享,去创建一个
[1] Timothy M. Chan,et al. Exact algorithms and APX-hardness results for geometric packing and covering problems , 2014, Comput. Geom..
[2] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..
[3] José R. Correa,et al. Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity , 2013, Discrete & Computational Geometry.
[4] Erik Jan van Leeuwen,et al. PTAS for Weighted Set Cover on Unit Squares , 2010, APPROX-RANDOM.
[5] Stefan Felsner,et al. Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve , 2013, Comput. Geom..
[6] Donald E. Knuth,et al. The Problem of Compatible Representatives , 1992, SIAM J. Discret. Math..
[7] Anna Lubiw,et al. A weighted min-max relation for intervals , 1990, J. Comb. Theory, Ser. B.
[8] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[9] Alejandro López-Ortiz,et al. The Within-Strip Discrete Unit Disk Cover Problem , 2017, CCCG.
[10] Susmita Sur-Kolay,et al. Approximation algorithms for maximum independent set of a unit disk graph , 2015, Inf. Process. Lett..
[11] José R. Correa,et al. Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity , 2013, Discret. Comput. Geom..