One of the ``problèmes plaisants et délectables by Claude Berge (Un des ``problèmes plaisants et délectables de Claude Berge).

DOI10.1016/J.DISC.2005.12.027zbMATH Open1104.68035OpenAlexW2006258407MaRDI QIDQ2433697FDOQ2433697

Authors: Antoine Deza, David Avis 

Publication date: 30 October 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.027

Recommendations

• On the generalized Berge sorting conjecture
• Berge sorting
• STACS 2005
• A lemma and a conjecture on the cost of rearrangements
• Efficient algorithms for sorting \(k\)-sets in bins

zbMATH Keywords

complexitysortingoptimal algorithm

Mathematics Subject Classification ID

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

Cites Work

• Berge sorting

Cited In (2)

• Berge sorting
• On the generalized Berge sorting conjecture

This page was built for publication: One of the ``problèmes plaisants et délectables by Claude Berge (Un des ``problèmes plaisants et délectables de Claude Berge).

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