Improving worst-case behavior of heaps

DOI10.1007/BF01934511zbMATH Open0528.68041MaRDI QIDQ786534FDOQ786534

Authors: Svante Carlsson 

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

treedata structuresorting24, 14-18 (1984)heap with scattered leavesHEAPSORTworst-case behavior of operations on heaps

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cites Work

• Improving worst-case behavior of heaps
• On an optimality property of ternary trees

Cited In (7)

• A variant of heapsort with almost optimal number of comparisons
• Generating good starting solutions for the \(p\)-median problem in the plane
• Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches
• New heuristic algorithms for solving the planar \(p\)-median problem
• New local searches for solving the multi-source Weber problem
• Improving worst-case behavior of heaps
• Exact algorithms for the solution of the grey pattern quadratic assignment problem

This page was built for publication: Improving worst-case behavior of heaps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786534)