Towards optimal multiple selection

DOI10.1007/11523468_9MaRDI QIDQ5716857zbMATH OpenOpenAlexFDO

Authors Kanela Kaligosi, K. Mehlhorn, J. Ian Munro, Peter Sanders

Publication date 10 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

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

Recommendations

• A random algorithm for multiselection
• An optimal parallel algorithm for the multiselection problem
• On computing an optimal permutation of ranks for multiselection
• The double selection problem
• New algorithms for selection

Cited in

(28)

• On constant factors in comparison-based geometric algorithms and data structures
• On Floyd and Rivest's SELECT algorithm
• Near-optimal online multiselection in internal and external memory
• Closing a long-standing complexity gap for selection: \(V _{3}(42) = 50\)
• On generalized comparison-based sorting problems
• Theory and implementation of online multiselection algorithms
• Comparing optimization algorithms for item selection in Mokken scale analysis
• scientific article; zbMATH DE number 4015673 (Why is no real title available?)
• Linear-time in-place selection with \(\varepsilon \cdot n\) element moves
• Select with groups of 3 or 4
• Selection Using Overlap Coefficients
• Optimal selection with alternative information
• scientific article; zbMATH DE number 4062610 (Why is no real title available?)
• scientific article; zbMATH DE number 1036711 (Why is no real title available?)
• scientific article; zbMATH DE number 2079316 (Why is no real title available?)
• OPTIMAL MULTIATTRIBUTE SCREENING
• Optimal solution to the multinomial selection problem for two alternatives
• Multikey quickselect
• Dynamic online multiselection in internal and external memory
• Optimal selection and sorting via dynamic programming
• A random algorithm for multiselection
• Fundamentals of Computation Theory
• Screening Alternatives In Multiple Criteria Subset Selection
• Query-based selection of optimal candidates under the Mallows model
• On computing an optimal permutation of ranks for multiselection
• Deterministic cache-oblivious funnelselect
• Lazy B-trees
• Selecting a single result from an aggregate of contradictory alternatives with use of multiset theory

This page was built for publication: Towards optimal multiple selection

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