2. Basic Data Structures

M. D. Atkinson, J.-R. Sack, N. Santoro and T. Strothotte: “Min-Max Heaps and Generalized Priority Queues”

J. Bentley: “Programming Pearls: Thanks Heaps”

B. Chazelle: “The Soft Heap: An Approximate Priority Queue with Optimal Error Rate”

M. J. Fischer and M. S. Paterson: “Fishpear: A Priority Queue Algorithm”

C. Osterman og C.Rego: “The Satellite List and New Data Structures for Symmentric Traveling Salesman Problems”

J. T. Stasko and J. S. Vitter: “Pairing Heaps: Experiments and Analysis”




Tilbage til hovedsiden


Januar 2003 Keld Helsgaun