Hitting sets : VC-dimension and Multicut
In this manuscript we study hitting sets both from a combinatorial and from an algorithmic point of view. A hitting set is a subset of vertices of a hypergraph which intersects all the hyperedges. A packing is a subset of pairwise disjoint hyperedges. In the general case, there is no function linkin...
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
Université Montpellier II - Sciences et Techniques du Languedoc
2013
|
| Subjects: | |
| Online Access: | http://tel.archives-ouvertes.fr/tel-01012106 http://tel.archives-ouvertes.fr/docs/01/01/21/06/PDF/41528_BOUSQUET_2013_archivage-1_cor.1.pdf |