Approximability and parameterized complexity of multicover by c-intervals. / Van Bevern, René; Chen, Jiehua; Hüffner, Falk et al.
In: Information Processing Letters, Vol. 115, No. 10, 01.10.2015, p. 744-749.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Approximability and parameterized complexity of multicover by c-intervals
AU - Van Bevern, René
AU - Chen, Jiehua
AU - Hüffner, Falk
AU - Kratsch, Stefan
AU - Talmon, Nimrod
AU - Woeginger, Gerhard J.
PY - 2015/10/1
Y1 - 2015/10/1
N2 - A c-interval is the disjoint union of c intervals over N. The c-Interval Multicover problem is the special case of Set Multicover where all sets available for covering are c-intervals. We strengthen known APX-hardness results for c-Interval Multicover, show W[1]-hardness when parameterized by the solution size, and present fixed-parameter algorithms for alternative parameterizations.
AB - A c-interval is the disjoint union of c intervals over N. The c-Interval Multicover problem is the special case of Set Multicover where all sets available for covering are c-intervals. We strengthen known APX-hardness results for c-Interval Multicover, show W[1]-hardness when parameterized by the solution size, and present fixed-parameter algorithms for alternative parameterizations.
KW - Algorithms
KW - APX-hardness
KW - Fixed-parameter tractability
KW - NP-hard problems
KW - Set cover
KW - W[1]-hardness
UR - http://www.scopus.com/inward/record.url?scp=84971537241&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2015.03.004
DO - 10.1016/j.ipl.2015.03.004
M3 - Article
AN - SCOPUS:84971537241
VL - 115
SP - 744
EP - 749
JO - Information Processing Letters
JF - Information Processing Letters
SN - 0020-0190
IS - 10
ER -
ID: 22339874