# parameterized algorithms for geometric set cover

Are there any parametrized algorithms $W$-hardness results known for the computational problem Geometric Set Cover?

It is known that set cover problem is $W[2]$ hard when parametrized by the solution size? There might be some advantages when the sets are defined by geometric objects.

• What is W[2] hardness? – Vivek Bagaria Apr 15 '14 at 14:52
• @Bagaria See W hierarchy, and may be before that reading this roughly explanation is easier. – Saeed May 19 '14 at 23:13