Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Single machine precedence constrained scheduling is a Vertex cover problem |
scientific article; zbMATH DE number 5551244
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine precedence constrained scheduling is a Vertex cover problem |
scientific article; zbMATH DE number 5551244 |
Statements
Single machine precedence constrained scheduling is a Vertex cover problem (English)
0 references
6 May 2009
0 references
algorithms
0 references
scheduling
0 references
vertex cover
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9197954
0 references
0.9194092
0 references
0.9109919
0 references
0 references
0.9059392
0 references
0.9000243
0 references
