Cargando…
Selection on X(1) + X(2) + ⋯ + X(m) via Cartesian product trees
Selection on the Cartesian product is a classic problem in computer science. Recently, an optimal algorithm for selection on A + B, based on soft heaps, was introduced. By combining this approach with layer-ordered heaps (LOHs), an algorithm using a balanced binary tree of A + B selections was propo...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
PeerJ Inc.
2021
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8093990/ https://www.ncbi.nlm.nih.gov/pubmed/33987456 http://dx.doi.org/10.7717/peerj-cs.483 |