conference paper Open access
An Efficient Algorithm for the Approximate Median Selection Problem
Sebastiano Battiatoa, Domenico Aldo Cantonea, Dario Catalanoa, Gianluca Cincottia, Micha Hofrib
- aDipartimento di Matematica e Informatica, Università di Catania, Viale A. Doria 6, I-95125, Catania, Italy
- bDepartment of Computer Science, WPI, 100 Institute Road, Worcester, MA, 01609-2280, USA
Lecture notes in computer scienceSpringer Science+Business Media2000-01-01 37 citations32 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRAn efficient algorithm for the approximate median selection problem that works in-place; it is fast and easy to implement, and returns, with high probability, a very close estimate of the true median. (Semantic Scholar)

