Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,786,943 papers from all fields of science
Search
Sign In
Create Free Account
Set cover problem
Known as:
Hitting set
, Set-covering problem
, Set covering problem
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
Ant colony optimization algorithms
Approximation algorithm
Automatic summarization
Bounded expansion
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Cultural Algorithms for the Set Covering Problem
Broderick Crawford
,
Ricardo Soto
,
É. Monfroy
International Conference on Swarm Intelligence
2013
Corpus ID: 10409764
This paper addresses the solution of weighted set covering problems using cultural algorithms. The weighted set covering problem…
Expand
2010
2010
Advanced process planning for subtractive rapid prototyping
J. Petrzelka
,
M. Frank
2010
Corpus ID: 55160065
Purpose – Subtractive rapid prototyping (SRP) uses layer‐based removal from a plurality of orientations in order to create…
Expand
2008
2008
Mobile Pee-to-Peer systems using Super Peers for Mobile Environments
Jung-Suk Han
,
Kwang-Jo Lee
,
Jin-Woo Song
,
Sung-Bong Yang
International Conference on Information…
2008
Corpus ID: 16006265
As the number of mobile device users increases, many researches on pee-to-peer (P2P) systems in mobile environments have been…
Expand
2006
2006
Matrix games in the multicast networks: maximum information flows with network switching
Xue-Bin Liang
IEEE Transactions on Information Theory
2006
Corpus ID: 748519
Network coding for achieving the maximum information flow in the multicast networks has been proposed by Ahlswede, Cai, Li, and…
Expand
2002
2002
Approximating Min-sum Set Cover
U. Feige
,
L. Lovász
,
P. Tetali
International Workshop on Approximation…
2002
Corpus ID: 124921004
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…
Expand
2001
2001
Optimization of Dynamic Hardware Reconfigurations
J. Teich
,
S. Fekete
,
Jörg Schepers
Journal of Supercomputing
2001
Corpus ID: 13985572
Recent generations of Field Programmable Gate Arrays (FPGA) allow the dynamic reconfiguration of cells on the chip during run…
Expand
1995
1995
A BIST approach to delay fault testing with reduced test length
B. Wurth
,
K. Fuchs
Proceedings the European Design and Test…
1995
Corpus ID: 8448605
A cost-effective built-in self testing (BIST) method for the detection of delay faults is presented. A multiple-input signature…
Expand
1993
1993
Experiments with parallel branch-and-bound algorithms for the set covering problem
R. Rushmeier
,
G. Nemhauser
Operations Research Letters
1993
Corpus ID: 120420190
1989
1989
Sex determination and monogeny in terrestrial isopods Armadillidium vulgare (Latreille, 1804) and Armadillidium nasatum Budde-Lund, 1885
P. Juchault
,
J. Legrand
1989
Corpus ID: 86217507
1975
1975
A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
M. Bazaraa
,
J. Goode
Operational Research
1975
Corpus ID: 45864946
This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE