Optimally selecting the top k values from X + Y with layer-ordered heaps
Sign Up to like & getrecommendations! Published in 2021 at "PeerJ Computer Science"
DOI: 10.7717/peerj-cs.501
Abstract: 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 Xi+Yj. The algorithm relies on layer-ordered… read more here.
Keywords: top values; selecting top; layer ordered; ordered heaps ... See more keywords