A parameterized algorithm for the hyperplane-cover problem
We consider the problem of covering a given set of points in the Euclidean space R(m) by a small number k of hyperplanes of dimensions bounded by d, where d <= m. We present a very simple parameterized algorithm for the problem, and give thorough mathematical analysis to prove the correctness and derive the complexity of the algorithm. When the algorithm is applied on the standard HYPERPLANE-COVER problem in R(d), it runs in time O*(k((d-1)k)/1.3(k)) improving the previous best algorithm of running time O*(k(dk+d)) for the problem. When the algorithm is applied on the LINE-COVER problem in R(2), it runs in time O*(k(k)/1.35(k)) improving the previous best algorithm of running time O*(k(2)k/4.84(k)) for the problem. (C) 2010 Elsevier B.V. All rights reserved.
parameterized algorithm hyperplane-cover line-cover computational geometry