scientific article; zbMATH DE number 3851099

From MaRDI portal
Publication:3320385





The author presents an algorithm for computing all minimal systems of distinct representatives for a given finite collection of finite sets. The algorithm is of a dynamic programming type. Using a straightforward characterisation of the different cases arising when the collection of finite sets is extended by a new set, a complete list for all minimal systems of distinct representatives for the first i sets is maintained. The paper completely neglects to investigate the complexity of the involved algorithm; this is clearly exponential time. On the other hand this is not surprising since (as can be shown by a trivial reduction from VERTEX COVER) the problem of deciding whether there exists a system of distinct representatives of a given size is NP-complete.











This page was built for publication:

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