Set cover problem

Known as: Hitting set, Set-covering problem, Set covering problem

The set cover problem is a classical question in combinatorics, computer science and complexity theory. It is one of Karp's 21 NP-complete problems…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

The set covering problem seeks for minimum cost family of subsets from n given subsets, which together covers the complete set…

2013

This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem…

2006

In the unweighted set-cover problem we are given a set of elements E={ e1,e2, ...,en } and a collection $\cal F$ of subsets of E…

2006

Network coding for achieving the maximum information flow in the multicast networks has been proposed by Ahlswede, Cai, Li, and…

2002

The input to the min sum set cover problem is a collection of n sets that jointly cover m elements. The output is a linear order…

1998

In this paper we consider the Maximum Horn Satisfiability problem, which is reduced to the problem of finding a minimum…

1996

We show that hitting sets can derandomize any probabilistic, two-sided error algorithm. This gives a positive answer to a…

1995

A cost-effective built-in self testing (BIST) method for the detection of delay faults is presented. A multiple-input signature…

1989

1975

This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality…