Add to ORKGWe present algorithms for the two layer straightline crossing minimization problem that are able to compute exact optima. Our computational results lead us to the conclusion that there is no need for heuristics if one layer is fixed, even though the problem is NP-hard, and that for the general problem with two variable layers, true optima can be computed for sparse instances in which the smaller layer contains up to 15 nodes. For bigger instances, the iterated barycenter method turns out to be the method of choice among several popular heuristics whose performance we could assess by comparing the results to optimum solutions
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\...
In the plane, we can find a weak "-net for convex sets consisting of O(" \Gamma2 ) point...
We study the problem of finding small weak ε-nets in three dimensions and provide new upper and lowe...
We present algorithms for the two layer straightline crossing minimization problem that are able to ...
AbstractGiven a set P of points in the plane, a set of points Q is a weak ε-net with respect to a fa...
This thesis deals with strong and weak ǫ-nets in geometry and related problems. In the first ha...
A finite set $N \subset \R^d$ is a {\em weak $\eps$-net} for an $n$-point set $X\subset \R^d$ (with ...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
Given a set system (X, R) with VC-dimension d, the celebrated result of Haussler and Welzl (1987) sh...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
International audienceShowing the existence of small-sized epsilon-nets has been the subject of inve...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\e...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
One of our results: let X be a finite set on the plane, 0 < g < 1, then there exists a set F (...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\...
In the plane, we can find a weak "-net for convex sets consisting of O(" \Gamma2 ) point...
We study the problem of finding small weak ε-nets in three dimensions and provide new upper and lowe...
We present algorithms for the two layer straightline crossing minimization problem that are able to ...
AbstractGiven a set P of points in the plane, a set of points Q is a weak ε-net with respect to a fa...
This thesis deals with strong and weak ǫ-nets in geometry and related problems. In the first ha...
A finite set $N \subset \R^d$ is a {\em weak $\eps$-net} for an $n$-point set $X\subset \R^d$ (with ...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become...
Given a set system (X, R) with VC-dimension d, the celebrated result of Haussler and Welzl (1987) sh...
International audienceFollowing groundbreaking work by Haussler and Welzl (1987), the use of small-n...
International audienceShowing the existence of small-sized epsilon-nets has been the subject of inve...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\e...
AbstractGiven a set P of n points in Rd and ϵ>0, we consider the problem of constructing weak ϵ-nets...
One of our results: let X be a finite set on the plane, 0 < g < 1, then there exists a set F (...
Given a set P of n points in Rd and $\epsilon$ > 0, we consider the problem of constructing weak $\...
In the plane, we can find a weak "-net for convex sets consisting of O(" \Gamma2 ) point...
We study the problem of finding small weak ε-nets in three dimensions and provide new upper and lowe...