A hybrid algorithm for finding the kth smallest of n elements in O(n) time

Annals of Operations Research

Volumn 13, Issue 1, 1988, Pages 399-419

  Fischetti, Matteo ^a   Martello, Silvano ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346978554     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/BF02288326     Document Type: Article

References (11)

1. Time bounds for selection
2. Remark on algorithm 489
3. Algorithm 410, partial sorting
4. The algorithm SELECT for finding the ith smallest of n elements
5. Algorithm 63, PARTITION, and Algorithm 65, FIND
6. Fast approximation algorithms for knapsack problems
7. Understanding the complexity of interpolation search
8. Certification of algorithms 63, 64 and 65, PARTITION, QUICKSORT and FIND
9. Finding the median
10. An O(| E|log log| V|) algorithm for finding minimum spanning trees