Improving worst-case behavior of heaps
From MaRDI portal
Publication:786534
DOI10.1007/BF01934511zbMath0528.68041MaRDI QIDQ786534
Publication date: 1984
Published in: BIT (Search for Journal in Brave)
treesortingdata structure24, 14-18 (1984)heap with scattered leavesHEAPSORTworst-case behavior of operations on heaps
Related Items (7)
New heuristic algorithms for solving the planar \(p\)-median problem ⋮ A variant of heapsort with almost optimal number of comparisons ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ Exact algorithms for the solution of the grey pattern quadratic assignment problem ⋮ New local searches for solving the multi-source Weber problem ⋮ Generating good starting solutions for the p-median problem in the plane ⋮ Improving worst-case behavior of heaps
Cites Work
This page was built for publication: Improving worst-case behavior of heaps
