Optimal narrowing of a block of sortings in optimal time

DOI10.1023/A:1009870418160zbMath0947.68045OpenAlexW1574636807MaRDI QIDQ1975205

Alain Colmerauer, Noelle Bleuzen-Guernalec

Publication date: 9 April 2000

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009870418160

zbMATH Keywords

complexitysorting

Mathematics Subject Classification ID

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

Related Items (5)

Filtering algorithms for the multiset ordering constraint ⋮ Computing leximin-optimal solutions in constraint networks ⋮ Multiconsistency and robustness with global constraints ⋮ Global constraint catalogue: past, present and future ⋮ Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices

This page was built for publication: Optimal narrowing of a block of sortings in optimal time