Skip to search formSkip to main contentSkip to account menu

Covering problems

Known as: Covering, Covering problem 
In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Bipartite dimensionComputer scienceLinear programmingPetri net

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem
The set covering problem seeks for minimum cost family of subsets from n given subsets, which together covers the complete set… 
Review
2012
Review
2012
Secret Sharing Schemes and Linear Codes
The study of secret sharing schemes was independently initiated by Shamir and Blakely in 1979. Since then several other secret… 
2012
2012
Facility location and scale decision problem with customer preference
2010
2010
Extremal statistics of curved growing interfaces in 1+1 dimensions
We study the joint probability distribution function (pdf) Pt(M,XM) of the maximum M of the height and its position XM of a… 
2009
2009
Integer programming methods for reserve selection and design
How many nature reserves should there be? Where should they be located? Which places have highest priority for protection… 
2005
2005
A Self-Adjusting Algorithm for Driver Scheduling
Public transport driver scheduling is a world wide problem, which is NP-hard. Although some mathematically based methods are… 
2005
2005
Requiring Connectivity in the Set Covering Problem
Given a bipartite graph with bipartition V and W, a cover is a subset C$${\subseteq}$$V such that each node of W is adjacent to… 
1999
1999
Automatic test case generation from requirements specifications for real-time embedded systems
This paper presents continuing research toward automatic generation of test cases from requirements specifications for event… 
Highly Cited
1994
Highly Cited
1994
Using a genetic algorithm to optimize problems with feasibility constraints
G.E. Liepins et al. (1990) have shown that genetic algorithm optimization of certain combinatorial optimization problems can be… 
1991
1991
Reliability covering problems
This paper studies the reliability covering problem, in which given routes provides service to various stops (e.g., of a transit… 
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)