English Wikipedia - The Free Encycl...
Download this dictionary
Covering problems
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 problem
s and usually
linear programs
, whose
dual problems
are called
packing problems
.
See more at Wikipedia.org...
© This article uses material from
Wikipedia
®
and is licensed under the
GNU Free Documentation License
and under the
Creative Commons Attribution-ShareAlike License