Sorting by short block-moves

DOI10.1007/s004530010041zbMath0960.68044OpenAlexW1980815056MaRDI QIDQ1587783

Lenwood S. Heath, John Paul C. Vergara

Publication date: 3 December 2000

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

sorting permutations

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (12)

APPROXIMATE BLOCK SORTING ⋮ Approximation algorithms for sorting by bounded singleton moves ⋮ A review of metrics on permutations for search landscape analysis ⋮ An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves ⋮ A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves ⋮ Block Sorting is Hard ⋮ A 14/11-approximation algorithm for sorting by short block-moves ⋮ On sorting by 3-bounded transpositions ⋮ Sorting a permutation by best short swaps ⋮ A quadratic time 2-approximation algorithm for block sorting ⋮ Sorting by bounded block-moves ⋮ On Sorting by 3-Bounded Transpositions

This page was built for publication: Sorting by short block-moves