Optimally selecting the top k values from X + Y with layer-ordered heaps

Selection and sorting the Cartesian sum, X + Y, are classic and important problems. Here, a new algorithm is presented, which generates the top k values of the form [Image: see text] . The algorithm relies on layer-ordered heaps, partial orderings of exponentially sized layers. The algorithm relies...

Descripción completa

Detalles Bibliográficos
Autor principal: Serang, Oliver
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2021
Materias:
Algorithms and Analysis of Algorithms
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8114817/
https://www.ncbi.nlm.nih.gov/pubmed/34013031
http://dx.doi.org/10.7717/peerj-cs.501

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8114817/
https://www.ncbi.nlm.nih.gov/pubmed/34013031
http://dx.doi.org/10.7717/peerj-cs.501

Ejemplares similares