No label defined (Q3320385)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3851099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3851099 |
Statements
1984
0 references
system of distinct representatives
0 references
algorithm
0 references
minimal systems
0 references
finite collection of finite sets
0 references
NP-complete
0 references
0.8915709
0 references
0.8847153
0 references
0.88074034
0 references
0.87891245
0 references
0.87732506
0 references
0.8697147
0 references
0.8695002
0 references
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.
0 references