Pages that link to "Item:Q2366561"
From MaRDI portal
The following pages link to An optimal algorithm for selection in a min-heap (Q2366561):
Displayed 18 items.
- K\(^{\ast}\): A heuristic search algorithm for finding the \(k\) shortest paths (Q420803) (← links)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- Optimal deterministic shallow cuttings for 3-d dominance ranges (Q1755735) (← links)
- Algorithms for proximity problems in higher dimensions (Q1917037) (← links)
- Construction of the similarity matrix for the spectral clustering method: numerical experiments (Q2309260) (← links)
- Encoding two-dimensional range top-\(k\) queries (Q2665908) (← links)
- Algorithms for Problems on Maximum Density Segment (Q2795931) (← links)
- A Survey on Priority Queues (Q2848973) (← links)
- Space-Efficient Frameworks for Top- <i>k</i> String Retrieval (Q3189644) (← links)
- Finding the k Shortest Paths (Q4210169) (← links)
- (Q4999015) (← links)
- Finding the k shortest paths in parallel (Q5048947) (← links)
- (Q5111875) (← links)
- A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs (Q5134451) (← links)
- Faster shortest-path algorithms for planar graphs (Q5906822) (← links)
- A nearly optimal randomized algorithm for explorable heap selection (Q6085985) (← links)
- Dynamic data structures for \(k\)-nearest neighbor queries (Q6101840) (← links)