An optimal algorithm for selection in a min-heap
From MaRDI portal
Recommendations
Cited in
(25)- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths
- A nearly optimal randomized algorithm for explorable heap selection
- scientific article; zbMATH DE number 7370604 (Why is no real title available?)
- On sorting, heaps, and minimum spanning trees
- Reflected min-Max heaps
- Algorithms for problems on maximum density segment
- Optimal deterministic shallow cuttings for 3-d dominance ranges
- Finding the \(k\) shortest paths in parallel
- Selection from heaps, row-sorted matrices, and \(X+Y\) using soft heaps
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence
- Algorithms for proximity problems in higher dimensions
- scientific article; zbMATH DE number 140493 (Why is no real title available?)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
- Space-efficient frameworks for top-\(k\) string retrieval
- Encoding two-dimensional range top-\(k\) queries
- Faster shortest-path algorithms for planar graphs
- A nearly optimal randomized algorithm for explorable heap selection
- Dynamic data structures for \(k\)-nearest neighbor queries
- Finding the k Shortest Paths
- \(k\)-best solutions of MSO problems on tree-decomposable graphs
- A new \(O(m+k n \log \overline{d})\) algorithm to find the \(k\) shortest paths in acyclic digraphs
- Optimal incremental sorting
- Construction of the similarity matrix for the spectral clustering method: numerical experiments
- A selectable sloppy heap
- A survey on priority queues
This page was built for publication: An optimal algorithm for selection in a min-heap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366561)
