Parameterized exact and approximation algorithms for maximumk-set cover and related satisfiability problems

DOI10.1051/ita/2016022zbMath1400.68081arXiv1309.4718MaRDI QIDQ2956881

Vangelis Th. Paschos, Édouard Bonnet, Florian Sikora

Publication date: 19 January 2017

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.4718

zbMATH Keywords

parameterized complexity; parameterized approximation; max k-set cover

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C27: Combinatorial optimization

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68W25: Approximation algorithms