Covering a set of points with a minimum number of lines

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3998 LNCS, Issue , 2006, Pages 6-17

  Grantson, Magdalene ^a   Levcopoulos, Christos ^a  

^a LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; FAULT TREE ANALYSIS; NUMERICAL METHODS; OPTIMIZATION;

ALGEBRAIC COMPUTATION TREE; FACTOR APPROXIMATION; LOWER BOUND; MINIMUM LINE COVERING PROBLEM;

PROBLEM SOLVING;

EID: 33746034919     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_4     Document Type: Conference Paper

References (9)

1. M. Ben-Or. Lower Bounds for Algebraic Computation Trees. Proc. 15th Ann. ACM Symp. on Theory of Comp., 80-86. ACM Press, New York, NY, USA 1983
2. H. Edelsbrunner, L. Guibas and J.Stolfi. Optimal Point Location in a Monotone Subdivision. SIAM J. Comput. 15:317-340.Society for Industrial and Applied Mathematics, Philadelphia, PA, USA 1986
3. M. Grantson and C. Levcopoulos. Covering a Set of Points with a Minimum Number of Lines. Technical Report LU-CS-TR:2005-236, ISSN 1650-1276 Report 156. Also at: http://www.cs.lth.se/home/Magdalene_Grantson/line.pdf
4. L. Guibas, M. Overmars, J. Robert. The Exact Fitting Problem in Higher Dimensions. Computational Geometry: Theory and Applications, 6:215-230. 1996
5. D. Johnson. Approximation Algorithms for Combinatorial Problems. J. of Comp. Syst. Sci. 9:256-278. 1974
6. V. Kumar, S. Arya, and H. Ramesh. Hardness of Set Cover With Intersection 1. Proc. 27th Int. Coll. Automata, Languages and Programming, LNCS 1853:624-635. Springer-Verlag, Heidelberg, Germany 2000
7. S. Langerman and P. Morin. Covering Things with Things. Proc. 10th Annual Europ. Symp. on Algorithms (Rome, Italy), LNCS 2461:662-673. Springer-Verlag, Heidelberg, Germany, 2002
8. N. Megiddo and A. Tamir. On the Complexity of Locating Linear Facilities in the Plane. Operation Research Letters 1:194-197. 1982
9. N. Sarnak, and R.E. Tarjan. Planar Point Location Using Persistent Search Tree. Comm. ACM 29:669-679. ACM Press, New York, NY, USA 1986