DeepAI AI Chat
Log In Sign Up

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

by   Patrick Kreitzberg, et al.

Selection on the Cartesian product is a classic problem in computer science. Recently, an optimal algorithm for selection on X+Y, based on soft heaps, was introduced. By combining this approach with layer-ordered heaps (LOHs), an algorithm using a balanced binary tree of X+Y selections was proposed to perform k-selection on X_1+X_2+⋯+X_m in o(n· m + k· m), where X_i have length n. Here, that o(n· m + k· m) algorithm is combined with a novel, optimal LOH-based algorithm for selection on X+Y (without a soft heap). Performance of algorithms for selection on X_1+X_2+⋯+X_m are compared empirically, demonstrating the benefit of the algorithm proposed here.


page 1

page 2

page 3

page 4


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

Selection on the Cartesian sum, A+B, is a classic and important problem....

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...

ICON Challenge on Algorithm Selection

We present the results of the ICON Challenge on Algorithm Selection....

Improving HD-FEC decoding via bit marking

We review the recently introduced soft-aided bit-marking (SABM) algorith...

SegMobaTree: The Segmented Multilayer Online Balanced Tree for high-performance IPv6 Lookup in the Edge Network

With the development of IPv6 and edge computing, the edge network should...

On Minimal Accuracy Algorithm Selection in Computer Vision and Intelligent Systems

In this paper we discuss certain theoretical properties of algorithm sel...