We are going to analyze simple search tree algorithms for approximating d -Hitting Set, focussing on the case of factor-2 approximations for d = 3. We also derive several results for hypergraph instances of bounded degree, including a new polynomial-time approximation
AbstractGiven a collection C of subsets of size three of a finite set S and a positive integer k, th...
AbstractWe consider the Minimum Vertex Cover problem in hypergraphs in which every hyperedge has siz...
A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We st...
Based on the methodology we presented in earlier work on parameterized algorithms for 3-HITTING SET,...
In this paper, we show how to systematically improve on parameterized algorithms and their analysis,...
AbstractWe are going to analyze search tree algorithms for Weightedd-Hitting Set. Although the algor...
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F...
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F...
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F...
AbstractIn the hitting set problem one is given m subsets of a finite set N and one has to find an X...
In this paper, we focus on Hitting-Set, a fundamental problem in combinatorial optimization, through...
Abstract. A sunflower in a hypergraph is a set of hyperedges pairwise in-tersecting in exactly the s...
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain s...
A hitting set for a collection of sets is a set that has a non-empty intersection with each set in t...
International audienceThe geometric hitting set problem is one of the basic geometric com-binatorial...
AbstractGiven a collection C of subsets of size three of a finite set S and a positive integer k, th...
AbstractWe consider the Minimum Vertex Cover problem in hypergraphs in which every hyperedge has siz...
A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We st...
Based on the methodology we presented in earlier work on parameterized algorithms for 3-HITTING SET,...
In this paper, we show how to systematically improve on parameterized algorithms and their analysis,...
AbstractWe are going to analyze search tree algorithms for Weightedd-Hitting Set. Although the algor...
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F...
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F...
Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F...
AbstractIn the hitting set problem one is given m subsets of a finite set N and one has to find an X...
In this paper, we focus on Hitting-Set, a fundamental problem in combinatorial optimization, through...
Abstract. A sunflower in a hypergraph is a set of hyperedges pairwise in-tersecting in exactly the s...
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain s...
A hitting set for a collection of sets is a set that has a non-empty intersection with each set in t...
International audienceThe geometric hitting set problem is one of the basic geometric com-binatorial...
AbstractGiven a collection C of subsets of size three of a finite set S and a positive integer k, th...
AbstractWe consider the Minimum Vertex Cover problem in hypergraphs in which every hyperedge has siz...
A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We st...
DOI
Add to ORKG