volume 33, issue 4, P717-729 2004
DOI: 10.1007/s00454-004-1108-4
View full text
|
|
Share

Abstract: An abstract NP-hard covering problem is presented and fixed-parameter tractable algorithms for this problem are described. The running times of the algorithms are expressed in terms of three parameters: n, the number of elements to be covered, k, the number of sets allowed in the covering, and d, the combinatorial dimension of the problem. The first algorithm is deterministic and has a running time of O (k dk n). The second algorithm is also deterministic and has a running time of O (k d(k+1) + n d+1 ). The t…

Expand abstract

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
22
0

Publication Types

Select...

Relationship

0
0

Authors

Journals