Some new results on inverse sorting problems

DOI10.1007/11533719_99MaRDI QIDQ5717022zbMATH OpenOpenAlexFDO

Authors Jianzhong Zhang, Xiaoguang Yang

Publication date 11 January 2006

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

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

zbMATH Keywords

Hamming distanceinverse problemoptimizationpartial inverse problemsorting problem

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
• Minimum cost sorting problem
• Improved bounds on sorting with length-weighted reversals
• Some inverse optimization problems under the Hamming distance

Cited in

(8)

• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Efficient algorithms for the inverse sorting problem with bound constraints under the \(l_{\infty }\)-norm and the Hamming distance
• New results in minimum-comparison sorting
• Inverse maximum flow problems under the weighted Hamming distance
• Minimum cost sorting problem
• The inverse parallel machine scheduling problem with minimum total completion time
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance

This page was built for publication: Some new results on inverse sorting problems

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