Editing Set cover problem (section)

== Hitting set formulation ==
Set covering is equivalent to the '''hitting set problem'''. That is seen by observing that an instance of set covering can
be viewed as an arbitrary [[bipartite graph]], with the universe represented by vertices on the left, the sets represented by vertices on the
right, and edges representing the membership of elements to sets. The task is then to find a minimum cardinality subset of left-vertices that has a non-trivial intersection with each of the right-vertices, which is precisely the hitting set problem.

In the field of [[computational geometry]], a hitting set for a collection of geometrical objects is also called a '''stabbing set''' or '''piercing set'''.<ref>{{Cite journal |last=Nielsen |first=Frank |date=2000-09-06 |title=Fast stabbing of boxes in high dimensions |url=http://www.lix.polytechnique.fr/%7Enielsen/pdf/2000-FastStabbingBoxes-TCS.pdf |journal=Theoretical Computer Science |volume=246 |issue=1 |pages=53–72 |doi=10.1016/S0304-3975(98)00336-3 |issn=0304-3975|doi-access=free }}</ref>