On the positive-negative partial set cover problem

DOI10.1016/j.ipl.2008.05.007zbMath1191.68251OpenAlexW2089573024MaRDI QIDQ975452

Pauli Miettinen

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.007

zbMATH Keywords

combinatorial problemsapproximation algorithmshardness of approximationset cover

Mathematics Subject Classification ID

Database theory (68P15) Approximation algorithms (68W25)

Related Items (5)

A simple approximation algorithm for minimum weight partial connected set cover ⋮ Comparing apples and oranges: measuring differences between exploratory data mining results ⋮ Logical correctors in the problem of classification by precedents ⋮ Evader interdiction: algorithms, complexity and collateral damage ⋮ Hybrid ASP-based Approach to Pattern Mining

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
• On the hardness of approximating label-cover
• Parametrized complexity theory.

This page was built for publication: On the positive-negative partial set cover problem