A combinatorial optimization approach for the competence set expansion problem (Q3306332)
From MaRDI portal
!
WARNING
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 7233688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial optimization approach for the competence set expansion problem |
scientific article; zbMATH DE number 7233688 |
Statements
12 August 2020
0 references
competence set
0 references
NP-completeness
0 references
polynomial-time algorithm
0 references
exact algorithm
0 references
approximation algorithm
0 references
0.8695400357246399
0 references
0.8695400357246399
0 references
0.8535082936286926
0 references
0.8380646705627441
0 references
0.836437463760376
0 references
