A parameterized algorithm for the hyperplane-cover problem

Theoretical Computer Science

Volumn 411, Issue 44-46, 2010, Pages 4005-4009

  Wang, Jianxin ^a   Li, Wenjun ^a   Chen, Jianer ^a,b  

^a CENTRAL SOUTH UNIVERSITY   (China)

^b Department of Electrical and Computer Engineering   (United States)

Author keywords

Computational geometry; Hyperplane cover; Line cover; Parameterized algorithm

Indexed keywords

COVER PROBLEM; EUCLIDEAN SPACES; HYPERPLANE-COVER; LINE-COVER; MATHEMATICAL ANALYSIS; PARAMETERIZED ALGORITHM; RUNNING TIME;

COMPUTATIONAL GEOMETRY; PARAMETERIZATION;

ALGORITHMS;

EID: 77957666575     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.08.012     Document Type: Article

References (6)

1. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer
2. M. Grantson, and C. Levcopoulos Covering a set of points with a minimum number of lines Proc. 6th Italian Conference on Algorithms and Complexity CIAC 2006 Lecture Notes in Computer Science vol. 3998 2006 6 17
3. R. Jamison Finding little hyperplanes in bigger ones Linear Algebra and Its Applications 35 1981 11 19
4. V. Kumar, S. Arya, and H. Ramesh Hardness of set cover with intersection Proc. 27th Int. Coll. Automata, Languages and Programming ICALP 2000 Lecture Notes in Computer Science vol. 1853 2000 624 635
5. S. Langerman, and P. Morin Covering things with things Discrete & Computational Geometry 33 2005 717 729
6. N. Megiddo, and A. Tamir On the complexity of locating linear facilities in the plane Operations Research Letters 1 1982 194 197