Minimum cost sorting problem

MaRDI QIDQ3611464zbMATH OpenFDO

Authors Youliang Jin, Tongquan Zhang

Publication date 6 March 2009

zbMATH Keywords

computational complexitynetwork flowsorting problemtriangle inequality

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Some new results on inverse sorting problems
• Sorting with expensive comparands
• scientific article; zbMATH DE number 4110087
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• New results in minimum-comparison sorting

Cited in

(6)

• A lemma and a conjecture on the cost of rearrangements
• Sorting with expensive comparands
• Sorting with minimum data movement
• Sorting with minimum data movement
• Some new results on inverse sorting problems
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems

This page was built for publication: Minimum cost sorting problem

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