CIAC   2006 Italian Conference on Algorithms and Complexity
Wall of Fame | Most Viewed CIAC-2006 Paper
278views Algorithms» more  CIAC 2006»
13 years 9 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
1Download preprint from source278
2Download preprint from source160
3Download preprint from source135
4Download preprint from source131
5Download preprint from source125
6Download preprint from source111
7Download preprint from source110
8Download preprint from source106
9Download preprint from source103
10Download preprint from source100
11Download preprint from source97
12Download preprint from source84
13Download preprint from source81
14Download preprint from source79
15Download preprint from source76
16Download preprint from source76
17Download preprint from source75
18Download preprint from source69