Approximability and parameterized complexity of multicover by c-intervals

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

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
Publication status	Published - 1 Oct 2015
Externally published	Yes

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

ID: 22339874