On computing an optimal permutation of ranks for multiselection

DOI10.1016/J.CAMWA.2010.07.040zbMATH Open1205.90290OpenAlexW2057018832MaRDI QIDQ623154FDOQ623154

M. H. Alsuwaiyel

Publication date: 13 February 2011

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2010.07.040

zbMATH Keywords

algorithmsdynamic programmingselectionmultiselection

Mathematics Subject Classification ID

Dynamic programming (90C39) Searching and sorting (68P10)

Cites Work

• Time bounds for selection
• Refined complexity analysis for heap operations
• Optimal parallel multiselection on EREW PRAM
• A Unified Lower Bound for Selection and Set Partitioning Problems
• Optimal Parallel Algorithms For Multiselection On Mesh-Connected Computers
• Title not available (Why is that?)
• A random algorithm for multiselection

Cited In (5)

• A rank-based approach to the sequential selection and assignment problem
• Optimal permutation estimation in crowdsourcing problems
• Comments on ``Performance analysis for ordered selection combining schemes in Nakagami-m environments
• Title not available (Why is that?)
• A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset

   Recommendations

• Automata, Languages and Programming 👍 👎
• An optimal parallel algorithm for the multiselection problem 👍 👎
• A random algorithm for multiselection 👍 👎
• Optimal parallel multiselection on EREW PRAM 👍 👎
• Optimal selection and sorting via dynamic programming 👍 👎

This page was built for publication: On computing an optimal permutation of ranks for multiselection

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