Search
ChatPaper
AI Writing
analysis
Analysis
编组
Open Data
more
More
RankingsMust ReadingJournal&ConferenceAI TRAI HistoryMaster Reading TreeXiaomai's Star TalentsTrajectoryTalentNDI TrackerOpenAI sign Language
VIPCreated with Sketch.

Approximability And Parameterized Complexity Of Multicover By C-Intervals

Rene Van Bevern,Jiehua Chen,Falk Hueffner,Stefan Kratsch,Nimrod Talmon,Gerhard J. Woeginger

INFORMATION PROCESSING LETTERS（2015）

Cited 4|Views37
No score
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. (C) 2015 Elsevier B.V. All rights reserved.
More
Translated text
Key words
Algorithms,NP-hard problems,APX-hardness,Fixed-parameter tractability,W[1]-hardness,Set cover
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined