Publication date
May 2014
DOIAbstract
MHS2 is a heuristic-based approximation algorithm for solving the minimal hitting set/set cover problem
MHS2 is a heuristic-based approximation algorithm for solving the minimal hitting set/set cover problem
We introduce a 2-factor approximation algorithm for the minimum total covering number problem
problems admit no algorithms that simultaneously (1) find optimal solution (2) in polynomial time (3...
We present in this paper differential approximation results for min set cover and min weighted set c...
MHS2 is a heuristic-based approximation algorithm for solving the minimal hitting set/set cover prob...
MHS2 is a heuristic-based approximation algorithm for solving the minimal hitting set/set cover prob...
International audienceWe consider a natural generalization of the classical minimum hitting set prob...
We solve approximately the minimum set covering problem by developing a new heuristic, which is esse...
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) to...
A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational re...
AbstractWe consider a natural generalization of the classical minimum hitting set problem, the minim...
We consider a natural generalization of the classical minimum hitting set problem, the minimum hitti...
Generating minimal hitting sets of a collection of sets is known to be NP-hard, necessitating heuris...
We present in this paper differential approximation results for MIN SET COVER and MIN WEIGHTED SET C...
We present in this paper differential approximation results for min set cover and min weighted set c...
We are going to analyze simple search tree algorithms for approximating d -Hitting Set, focussing on...
We introduce a 2-factor approximation algorithm for the minimum total covering number problem
problems admit no algorithms that simultaneously (1) find optimal solution (2) in polynomial time (3...
We present in this paper differential approximation results for min set cover and min weighted set c...
MHS2 is a heuristic-based approximation algorithm for solving the minimal hitting set/set cover prob...
MHS2 is a heuristic-based approximation algorithm for solving the minimal hitting set/set cover prob...
International audienceWe consider a natural generalization of the classical minimum hitting set prob...
We solve approximately the minimum set covering problem by developing a new heuristic, which is esse...
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) to...
A metaheuristic algorithm is proposed for the solution of the Set Covering Problem. Computational re...
AbstractWe consider a natural generalization of the classical minimum hitting set problem, the minim...
We consider a natural generalization of the classical minimum hitting set problem, the minimum hitti...
Generating minimal hitting sets of a collection of sets is known to be NP-hard, necessitating heuris...
We present in this paper differential approximation results for MIN SET COVER and MIN WEIGHTED SET C...
We present in this paper differential approximation results for min set cover and min weighted set c...
We are going to analyze simple search tree algorithms for approximating d -Hitting Set, focussing on...
We introduce a 2-factor approximation algorithm for the minimum total covering number problem
problems admit no algorithms that simultaneously (1) find optimal solution (2) in polynomial time (3...
We present in this paper differential approximation results for min set cover and min weighted set c...
Add to ORKG