Covering Task
Jump to navigation
Jump to search
A Covering Task is a computatinal task that asks whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that.
References
2013
- http://en.wikipedia.org/wiki/Covering_problem
- In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that. Covering problems are minimization problems and usually linear programs, whose dual problems are called packing problems.
The most prominent examples of covering problems are the set cover problem, which is equivalent to the hitting set problem, and its special cases, the vertex cover problem and the edge cover problem.
- In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that. Covering problems are minimization problems and usually linear programs, whose dual problems are called packing problems.