Block sorting: a characterization and some heuristics

MaRDI QIDQ5503437zbMATH OpenFDO

Authors

Publication date 15 January 2009

zbMATH Keywords

block sortingcombinatorial characterization

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• APPROXIMATE BLOCK SORTING
• Block Sorting Is APX-Hard
• Fundamentals of Computation Theory
• Block Sorting is Hard
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves

Cited in

(12)

• A quadratic time 2-approximation algorithm for block sorting
• Optimal narrowing of a block of sortings in optimal time
• Block Sorting Is APX-Hard
• Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search
• Computing and Combinatorics
• APPROXIMATE BLOCK SORTING
• A 14/11-approximation algorithm for sorting by short block-moves
• Fundamentals of Computation Theory
• On an NP-hard sorting problem
• Block Sorting is Hard
• Sorting a bridge hand
• Short block-move-CPP is \textsf{NP}-complete

This page was built for publication: Block sorting: a characterization and some heuristics

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