Three new combination algorithms with the minimal change property

DOI10.1145/358589.358612zbMath0486.68070OpenAlexW1991364810MaRDI QIDQ3947143

Leonard H. Soicher, Clement Wing Hong Lam

Publication date: 1982

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/358589.358612

zbMATH Keywords

combinatorial algorithmsreverse lexicographical ordercomputations on discrete structuresloopless algorithmsloopless property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

On the correct implementation of the Hanurav-Vijayan selection procedure for unequal probability sampling without replacement ⋮ A low spatial complexity algorithm to generate combinations with the strong minimal change property ⋮ An algorithm for generating subsets of fixed size with a strong minimal change property

This page was built for publication: Three new combination algorithms with the minimal change property