New Heuristics for the Minimum 3-Hitting Set Problem
碩士 === 國立中正大學 === 資訊工程研究所 === 101 === Let C = {C1,C2, . . . ,Cm} be a collection of subsets of a finite set S. A hitting set D is a subset of S such that for i = 1, 2, . . . ,m, |D ∩ Ci| ≥ 1. An instance (S,C) is an input of the Minimum d-Hitting Set problem if |Ci| ≤ d for 1 ≤ i ≤ m. The Minimum d...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2013
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/53409143201541878157 |