AbstractThe paper contains the complete results for the complexity of the following three selection problems: (A) Find the 3 top elements (ordered) out of a linear order on n elements. (B) Find the 3rd element out of a linear order on n elements. (C) Find the 3 top elements (unordered) out of a linear order on n elements
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
In polyhedral combinatorics, the polytope related to a combinatorial optimization problem is examine...
We consider the problem of partial order production: arrange the elements of an unknown totally orde...
AbstractThe paper contains the complete results for the complexity of the following three selection ...
AbstractThe complexity of selection is analyzed for two sets, X + Y and matrices with sorted columns...
The multiple selection problem asks for the elements of rank r1, r2,..., rk from a linearly ordered ...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
Lower bounds are derived on the number of comparisons to solve several well-known selection problems...
A fundamental step in any cutting plane algorithm is separation: deciding whether a violated inequal...
The multiple selection problem asks for the elements of rank r1 , r2 , . . . , rk from a linearly o...
AbstractWe identify a class of problems, called controlled selection problems, and study their compl...
AbstractLet X and Y be two sorted n-vectors and A = X + Y be an n×n matrix with sorted rows and colu...
Classical problems of sorting and searching assume an underlying linear ordering of the objects bein...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
AbstractBalas and Saltzman identified several classes of facet inducing inequalities for the three-i...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
In polyhedral combinatorics, the polytope related to a combinatorial optimization problem is examine...
We consider the problem of partial order production: arrange the elements of an unknown totally orde...
AbstractThe paper contains the complete results for the complexity of the following three selection ...
AbstractThe complexity of selection is analyzed for two sets, X + Y and matrices with sorted columns...
The multiple selection problem asks for the elements of rank r1, r2,..., rk from a linearly ordered ...
Improving a long standing result of Schonhage, Paterson and Pippenger we show that the median of a s...
Lower bounds are derived on the number of comparisons to solve several well-known selection problems...
A fundamental step in any cutting plane algorithm is separation: deciding whether a violated inequal...
The multiple selection problem asks for the elements of rank r1 , r2 , . . . , rk from a linearly o...
AbstractWe identify a class of problems, called controlled selection problems, and study their compl...
AbstractLet X and Y be two sorted n-vectors and A = X + Y be an n×n matrix with sorted rows and colu...
Classical problems of sorting and searching assume an underlying linear ordering of the objects bein...
AbstractWe show that several versions of Floyd and Rivest's algorithm SELECT for finding the kth sma...
AbstractBalas and Saltzman identified several classes of facet inducing inequalities for the three-i...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
In polyhedral combinatorics, the polytope related to a combinatorial optimization problem is examine...
We consider the problem of partial order production: arrange the elements of an unknown totally orde...
DOI
Add to ORKG