scientific article; zbMATH DE number 3851099
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.
- On minimum dominating sets with minimum intersection
- An Algorithmic Analysis of the Intersection Property
- scientific article; zbMATH DE number 4068924
- A fast algorithm for finding interlocking sets
- An optimal algorithm for finding compact sets
- An algorithm for computing minimal Geršgorin sets.
- An optimal time and minimal space algorithm for rectangle intersection problems
- An incremental algorithm to construct a lattice of set intersections
- scientific article; zbMATH DE number 2242531
- scientific article; zbMATH DE number 3999696
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)