The soft heap: An approximate priority queue with optimal error rate

Journal of the ACM

Volumn 47, Issue 6, 2000, Pages 1012-1027

  Chazelle, Bernard ^a,b,c  

^a PRINCETON UNIVERSITY   (United States)

^b NEC LABORATORIES AMERICA   (United States)

^c Princeton University   (United States)

Author keywords

Amortization; Heap; Priority queue; Soft heap

Indexed keywords

AMORTIZATION; NONNUMERICAL ALGORITHMS; PRIORITY QUEUE; SOFT HEAP;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ERROR ANALYSIS; LINEAR PROGRAMMING; SORTING; TREES (MATHEMATICS);

QUEUEING THEORY;

EID: 0012608449     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/355541.355554     Document Type: Article

References (5)

1. BLUM, M., FLOYD, R. W., PRATT, V., RIVEST, R. L., TARJAN, R. E. 1973. Time bounds for selection. J. Comput. Syst. Sei. 7, 448-461.
2. CHAZELLE, B. 2000. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47, 6 (Nov.), 000-000.
3. FREDMAN, M. L., TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34, 596-615.
4. HUFFMAN, K., MEHLHORN, K., ROSENSTIEHL, P., TARJAN, R. E. 1986. Sorting Jordan sequences in linear time using level-linked search trees. Inf. Cont. 68, 170-184.
5. VUILLEMIN, J. 1978. A data structure for manipulating priority queues. Commun. ACM 21, 309-315.