We prove a lower bound of Omega(1/epsilon (m + log(d - a)) where a = [log(m) (1/4epsilon)] for the hitting set size for combinatorial rectangles of volume at least epsilon in [m](d) space, for epsilon is an element of [m(-(d-2)), 2/9] and d > 2. (C) 2002 Elsevier Science B.V. All rights reserved
AbstractBy an ABC-hit, we mean a triple (a,b,c) of relatively prime positive integers such that a+b=...
International audienceThe geometric hitting set problem is one of the basic geometric combinatorial ...
Abstract Given a set of n axis-parallel rectangles in the plane, finding a maximum independent set (...
We prove a lower bound of Omega(1/epsilon (m + log(d - a)) where a = [log(m) (1/4epsilon)] for the h...
We give the following two results. First, we give a deterministic algorithm which constructs a graph...
We describe a deterministic algorithm which, on input integers d, m and real number ffl 2 (0; 1), pr...
AbstractA k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedge...
A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We st...
International audienceThe geometric hitting set problem is one of the basic geometric com-binatorial...
International audienceThe geometric hitting set problem is one of the basic geometric combinatorial ...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
The gamma_2 norm of a real m by n matrix A is the minimum number t such that the column vectors of A...
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain s...
An LD(n, k, p, t; b) Lotto Design is a set of b k-sets (blocks) of an n-set such that any p-set inte...
AbstractBy an ABC-hit, we mean a triple (a,b,c) of relatively prime positive integers such that a+b=...
International audienceThe geometric hitting set problem is one of the basic geometric combinatorial ...
Abstract Given a set of n axis-parallel rectangles in the plane, finding a maximum independent set (...
We prove a lower bound of Omega(1/epsilon (m + log(d - a)) where a = [log(m) (1/4epsilon)] for the h...
We give the following two results. First, we give a deterministic algorithm which constructs a graph...
We describe a deterministic algorithm which, on input integers d, m and real number ffl 2 (0; 1), pr...
AbstractA k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedge...
A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We st...
International audienceThe geometric hitting set problem is one of the basic geometric com-binatorial...
International audienceThe geometric hitting set problem is one of the basic geometric combinatorial ...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
The gamma_2 norm of a real m by n matrix A is the minimum number t such that the column vectors of A...
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain s...
An LD(n, k, p, t; b) Lotto Design is a set of b k-sets (blocks) of an n-set such that any p-set inte...
AbstractBy an ABC-hit, we mean a triple (a,b,c) of relatively prime positive integers such that a+b=...
International audienceThe geometric hitting set problem is one of the basic geometric combinatorial ...
Abstract Given a set of n axis-parallel rectangles in the plane, finding a maximum independent set (...
DOI
Add to ORKG