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）

引用 4|浏览34

暂无评分

摘要

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.

查看译文

关键词

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

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要