DeepAI AI Chat
Log In Sign Up

Optimal selection on X+Y simplified with layer-ordered heaps

by   Oliver Serang, et al.
University of Montana

Selection on the Cartesian sum, A+B, is a classic and important problem. Frederickson's 1993 algorithm produced the first algorithm that made possible an optimal runtime. Kaplan et al.'s recent 2018 paper descibed an alternative optimal algorithm by using Chazelle's soft heaps. These extant optimal algorithms are very complex; this complexity can lead to difficulty implementing them and to poor performance in practice. Here, a new optimal algorithm is presented, which uses layer-ordered heaps. This new algorithm is both simple to implement and practically efficient.


page 1

page 2

page 3

page 4


Selection on X_1 + X_1 + ⋯ X_m via Cartesian product tree

Selection on the Cartesian product is a classic problem in computer scie...

Selection on X_1+X_2+... + X_m with layer-ordered heaps

Selection on X_1+X_2+... + X_m is an important problem with many applica...

Optimal construction of a layer-ordered heap

The layer-ordered heap (LOH) is a simple, recently proposed data structu...

Fast exact computation of the k most abundant isotope peaks with layer-ordered heaps

The theoretical computation of isotopic distribution of compounds is cru...

A note on optimal design for hierarchical generalized group testing

Choosing an optimal strategy for hierarchical group testing is an import...

The Neural Representation Benchmark and its Evaluation on Brain and Machine

A key requirement for the development of effective learning representati...

Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with the Ordered l1-Norm

In this paper we propose a primal-dual proximal extragradient algorithm ...