Approximability and parameterized complexity of multicover by c-intervals

René Van Bevern; Jiehua Chen; Falk Hüffner; Stefan Kratsch; Nimrod Talmon; Gerhard J. Woeginger

doi:10.1016/j.ipl.2015.03.004

Approximability and parameterized complexity of multicover by c-intervals

René Van Bevern
, Jiehua Chen
, Falk Hüffner
, Stefan Kratsch
, Nimrod Talmon
, Gerhard J. Woeginger

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	744-749
Number of pages	6
Journal	Information Processing Letters
Volume	115
Issue number	10
DOIs	https://doi.org/10.1016/j.ipl.2015.03.004
State	Published - 29 Jul 2014
Externally published	Yes

Keywords

APX-hardness
Algorithms
Fixed-parameter tractability
NP-hard problems
Set cover
W[1]-hardness

ASJC Scopus subject areas

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

10.1016/j.ipl.2015.03.004

Cite this

@article{24066d83d9174d2b886014fcba5f5328,

title = "Approximability and parameterized complexity of multicover by c-intervals",

abstract = "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.",

keywords = "APX-hardness, Algorithms, Fixed-parameter tractability, NP-hard problems, Set cover, W[1]-hardness",

author = "\{Van Bevern\}, Ren{\'e} and Jiehua Chen and Falk H{\"u}ffner and Stefan Kratsch and Nimrod Talmon and Woeginger, \{Gerhard J.\}",

year = "2014",

month = jul,

day = "29",

doi = "10.1016/j.ipl.2015.03.004",

language = "English",

volume = "115",

pages = "744--749",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "10",

}

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 - 2014/7/29

Y1 - 2014/7/29

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 - APX-hardness

KW - Algorithms

KW - Fixed-parameter tractability

KW - NP-hard problems

KW - Set cover

KW - W[1]-hardness

UR - https://www.scopus.com/pages/publications/84971537241

U2 - 10.1016/j.ipl.2015.03.004

DO - 10.1016/j.ipl.2015.03.004

M3 - Article

AN - SCOPUS:84971537241

SN - 0020-0190

VL - 115

SP - 744

EP - 749

JO - Information Processing Letters

JF - Information Processing Letters

IS - 10

ER -

Approximability and parameterized complexity of multicover by c-intervals

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this