On the positive-negative partial set cover problem

DOI10.1016/J.IPL.2008.05.007MaRDI QIDQ975452zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmsset covercombinatorial problemshardness of approximation

Mathematics Subject Classification ID

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

Recommendations

• A Unified Approach to Approximating Partial Covering Problems
• On combinatorial approximation of covering 0-1 integer programs and partial set cover
• Computing small partial coverings
• On partial covering for geometric set systems
• A threshold of ln n for approximating set cover

Cites work

• scientific article; zbMATH DE number 1629828 (Why is no real title available?)
• scientific article; zbMATH DE number 1445322 (Why is no real title available?)
• Approximation algorithms for the Label-Cover\(_{\text{MAX}}\) and Red-Blue Set Cover problems
• On the hardness of approximating label-cover
• Parametrized complexity theory.

Cited in

(8)

• scientific article; zbMATH DE number 1354909 (Why is no real title available?)
• Red blue set cover problem on axis-parallel hyperplanes and other objects
• Comparing apples and oranges: measuring differences between exploratory data mining results
• Evader interdiction: algorithms, complexity and collateral damage
• On a generalized sequential partially covering problem
• A simple approximation algorithm for minimum weight partial connected set cover
• Hybrid ASP-based approach to pattern mining
• Logical correctors in the problem of classification by precedents

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975452)