Optimal selection and sorting via dynamic programming

DOI10.1145/2444016.2493373zbMath1322.68065OpenAlexW1983840635MaRDI QIDQ5178742

Micha Hofri

Publication date: 16 March 2015

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2444016.2493373

zbMATH Keywords

Markov decision processoptimal sortinggraph isomorphismoptimal selectionsmall set

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorial optimization (90C27) Dynamic programming (90C39) Applications of continuous-time Markov processes on discrete state spaces (60J28) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Further analysis of the remedian algorithm ⋮ A selectable sloppy heap

This page was built for publication: Optimal selection and sorting via dynamic programming