Approximability and parameterized complexity of multicover by c-intervals

Open Webpage

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

Published: 2015, Last Modified: 12 May 2025Inf. Process. Lett. 2015EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•c-Interval Multicover is Set Multicover with each input set being the disjoint union of c intervals (a c-interval).•We show 2-Interval Multicover to be W[1]-hard with respect to the parameter “number of 2-intervals used in the cover”.•We show 2-Interval Multicover to be APX-hard even if only 1-intervals and 2-intervals consisting of 2 elements are input.