Improving order with queues

DOI10.1007/S10878-026-01419-2MaRDI QIDQ7232819zbMATH OpenFDO

Authors Andreas Karrenbauer, K. Mehlhorn, Pranabendu Misra, Paolo Luigi Rinaldi, Anna Twelsiek, Alireza Haqi, Siavash Rahimi Shateranloo

Publication date 23 April 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10878-026-01419-2

zbMATH Keywords

queuesproductionimproving orderpatience sort

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• scientific article; zbMATH DE number 3492580 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Algorithmic graph theory and perfect graphs
• Estimating the sortedness of a data stream
• Longest Increasing and Decreasing Subsequences
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Sorting Using Networks of Queues and Stacks
• The parallel stack loading problem minimizing the number of reshuffles in the retrieval stage
• The parallel stack loading problem to minimize blockages

This page was built for publication: Improving order with queues

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