Minimal approximate hitting sets and rul
β
Staal Vinterbo; Aleksander Γhrn
π
Article
π
2000
π
Elsevier Science
π
English
β 243 KB
A set S that has a non-empty intersection with every set in a collection of sets C is called a hitting set of C. If no elements can be removed from S without violating the hitting set property, then we say that S is minimal. Several interesting problems can in part be formulated as that of having to